Követés
Theodore Slaman
Theodore Slaman
E-mail megerősítve itt: math.berkeley.edu
Cím
Hivatkozott rá
Hivatkozott rá
Év
On the strength of Ramsey's theorem for pairs
PA Cholak, CG Jockusch, TA Slaman
The Journal of Symbolic Logic 66 (1), 1-55, 2001
2882001
Generic copies of countable structures
C Ash, J Knight, M Manasse, T Slaman
Annals of Pure and Applied Logic 42 (3), 195-205, 1989
2101989
Randomness and recursive enumerability
A Kucera, T Slaman
SIAM Journal on Computing 31 (1), 199-211, 2001
1712001
On the strength of Ramsey's theorem
D Seetapun, TA Slaman
Notre Dame Journal of Formal Logic 36 (4), 570-582, 1995
1571995
Definable functions on degrees
TA Slaman, JR Steel
Cabal Seminar 81–85: Proceedings, Caltech-UCLA Logic Seminar 1981–85, 37-55, 2006
1232006
Relative to any nonrecursive set
T Slaman
Proceedings of the American Mathematical Society 126 (7), 2117-2122, 1998
1191998
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
1041998
Defining the Turing jump
RA Shore, TA Slaman
Mathematical Research Letters 6 (6), 711-722, 1999
971999
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
922014
Comparing dnr and wwkl
K Ambos-Spies, B Kjos-Hanssen, S Lempp, TA Slaman
The Journal of Symbolic Logic 69 (4), 1089-1104, 2004
752004
The atomic model theorem and type omitting
D Hirschfeldt, R Shore, T Slaman
Transactions of the American Mathematical Society 361 (11), 5805-5837, 2009
732009
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
721994
Definability in the Turing degrees
TA Slaman, WH Woodin
Illinois Journal of Mathematics 30 (2), 320-334, 1986
711986
Measures and their random reals
J Reimann, T Slaman
Transactions of the American Mathematical Society 367 (7), 5081-5097, 2015
622015
Definability in degree structures
TA Slaman, WH Woodin
to appear, 2005
612005
Σ_ {𝑛}-bounding and Δ_ {𝑛}-induction
T Slaman
Proceedings of the American Mathematical Society 132 (8), 2449-2456, 2004
592004
Complementation in the Turing degrees
TA Slaman, JR Steel
The Journal of symbolic logic 54 (1), 160-176, 1989
581989
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
572008
Working below a high recursively enumerable degree
RA Shore, TA Slaman
The Journal of Symbolic Logic 58 (3), 824-859, 1993
531993
Π11-conservation of combinatorial principles weaker than Ramsey’s theorem for pairs
CT Chong, TA Slaman, Y Yang
Advances in Mathematics 230 (3), 1060-1077, 2012
502012
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20