-
Allen Slaman (born
April 17, 1954) is a
professor of
mathematics at the
University of California,
Berkeley who
works in
recursion theory.
Slaman and W...
-
Hilde Slaman (born 19 July 1943) is a
former Dutch sprinter and middle-distance runner. She won the KNAU Cup, the
award for the
female Dutch athlete of...
-
degrees containing com****bly
enumerable sets. A deep
theorem of S**** and
Slaman states that the
function mapping a
degree x to the
degree of its Turing...
- Turing-equivalent to B′. The
converse of this
implication is not true. (S**** and
Slaman, 1999) The
function mapping X to X′ is
definable in the
partial order of...
-
example is
shown to the right. L. A.
Harrington and T. A.
Slaman (see Nies, S**** &
Slaman (1998)): The first-order
theory of the r.e.
degrees in the...
-
small number of its
tenured faculty members. Chi Tat Chong,
Theodore A
Slaman and Yue Yang, The
inductive strength of Ramsey's
Theorem for Pairs, Advances...
- {\displaystyle b} respectively, are not isomorphic. In
joint work with
Theodore Slaman, S****
showed that the
Turing jump is
definable in D {\displaystyle {\mathcal...
- of Constructibility, was
supervised by
Akihiro Kanamori. With
Theodore Slaman,
Groszek showed that (if they
exist at all) non-constructible real numbers...
- Sy Friedman, Leo Harrington,
Richard S****,
Steve Simpson and
Theodore Slaman.
Degrees of unsolvability,
Princeton University Press 1963, 1966 Saturated...
-
Skolem (Norway 1887–1963)
Dimiter Skordev (Bulgaria, born 1936)
Theodore Slaman (US, born 1954)
Raymond Smullyan (US, 1919–2017)
William of
Soissons (France...
