Theodore Slaman
Theodore Slaman
Verified email at math.berkeley.edu
Title
Cited by
Cited by
Year
On the strength of Ramsey's theorem for pairs
PA Cholak, CG Jockusch, TA Slaman
Journal of Symbolic Logic, 1-55, 2001
2602001
Generic copies of countable structures
C Ash, J Knight, M Manasse, T Slaman
Annals of Pure and Applied Logic 42 (3), 195-205, 1989
1781989
Randomness and recursive enumerability
A Kucera, T Slaman
SIAM Journal on Computing 31 (1), 199-211, 2001
1592001
On the strength of Ramsey's theorem
D Seetapun, TA Slaman
Notre Dame Journal of Formal Logic 36 (4), 570-582, 1995
1341995
Relative to any nonrecursive set
T Slaman
Proceedings of the American Mathematical Society 126 (7), 2117-2122, 1998
1041998
Definable functions on degrees
TA Slaman, JR Steel
Cabal Seminar 81–85, 37-55, 1988
1041988
Interpretability and definability in the recursively enumerable degrees
A Nies, RA Shore, TA Slaman
Proceedings of the London Mathematical Society 77 (2), 241-291, 1998
941998
Defining the Turing jump
RA Shore, TA Slaman
Mathematical Research Letters 6 (6), 711-722, 1999
921999
The metamathematics of stable Ramsey’s theorem for pairs
C Chong, T Slaman, Y Yang
Journal of the American Mathematical Society 27 (3), 863-892, 2014
812014
Comparing dnr and wwkl
K Ambos-Spies, B Kjos-Hanssen, S Lempp, TA Slaman
Journal of Symbolic Logic, 1089-1104, 2004
722004
Extremes in the degrees of inferability
L Fortnow, W Gasarch, S Jain, E Kinber, M Kummer, S Kurtz, ...
Annals of pure and applied logic 66 (3), 231-276, 1994
641994
Definability in the Turing degrees
TA Slaman, WH Woodin
J. Symbolic Logic, 1986
631986
The atomic model theorem and type omitting
D Hirschfeldt, R Shore, T Slaman
Transactions of the American Mathematical Society 361 (11), 5805-5837, 2009
622009
Complementation in the Turing degrees
TA Slaman, JR Steel
Journal of Symbolic Logic, 160-176, 1989
551989
Definability in degree structures
TA Slaman, WH Woodin
preprint, 2005
532005
Σ_ {𝑛}-bounding and Δ_ {𝑛}-induction
T Slaman
Proceedings of the American Mathematical Society 132 (8), 2449-2456, 2004
532004
Working below a high recursively enumerable degree
RA Shore, TA Slaman
The Journal of Symbolic Logic 58 (3), 824-859, 1993
501993
The strength of some combinatorial principles related to Ramsey's theorem for pairs
DR Hirschfeldt, CG Jockusch Jr, B Kjos-Hanssen, S Lempp, TA Slaman
Computational Prospects Of Infinity: Part II: Presented Talks, 143-161, 2008
492008
Working below a low2 recursively enumerably degree
RA Shore, TA Slaman
Archive for Mathematical Logic 29 (3), 201-211, 1990
451990
Degree structures
TA Slaman
Proc. Int. Cong. Math., Kyoto, 303-316, 1990
441990
The system can't perform the operation now. Try again later.
Articles 1–20