Theodore Slaman

Cited by

	All	Since 2016
Citations	3287	960
h-index	31	17
i10-index	77	27

260

130

195

198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202110 18 25 4 36 29 19 30 51 52 82 50 75 52 55 74 83 82 107 106 142 124 108 135 141 151 190 224 182 256 191 145 158 27

Co-authors

Chi Tat ChongNational UNIVERSITY OF SINGAPOREVerified email at nus.edu.sg
Verónica BecherUniversidad de Buenos Aires & CONICETVerified email at dc.uba.ar
Jan ReimannAssociate Professor of Mathematics, Pennsylvania State UniversityVerified email at math.psu.edu
rod downeyVictoria University, WellingtonVerified email at vuw.ac.nz
Pablo Ariel HeiberUniversidad de Buenos AiresVerified email at dc.uba.ar
Bjørn Kjos-HanssenProfessor of Mathematics, University of Hawaii at ManoaVerified email at hawaii.edu
Antonio MontalbánUniversity of California, BerkeleyVerified email at berkeley.edu
Mark ManasseChief Cryptographer, i2ChainVerified email at i2chain.com
Lance FortnowIllinois Institute of TechnologyVerified email at iit.edu
Stuart KurtzProfessor of Computer Science, The University of ChicagoVerified email at cs.uchicago.edu
Wolfgang MaassProfessor of Computer Science, Graz University of TechnologyVerified email at igi.tugraz.at
Bakh KhoussainovProfessor of Computer Science, The University of AucklandVerified email at cs.auckland.ac.nz
Andrew MarksUCLAVerified email at math.ucla.edu
Antonín KučeraCharles universityVerified email at mbox.ms.mff.cuni.cz
Pavel SemukhinUniversity of OxfordVerified email at semukhin.name
Wolfgang MerkleSenior Lecturer, Heidelberg UniversityVerified email at math.uni-heidelberg.de
Frank StephanNational University of SingaporeVerified email at comp.nus.edu.sg
Sanjay JainProfessor of Computer Science, National University of SingaporeVerified email at comp.nus.edu.sg
Yann BugeaudUniversité de StrasbourgVerified email at math.unistra.fr
Marat ArslanovКазанский (Приволжский) федеральный университет, институт математкиVerified email at kpfu.ru

Theodore Slaman

University of California Berkeley

Verified email at math.berkeley.edu

Mathematical Logic Recursion Theory


Title Sort by citations Sort by year Sort by 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	260	2001
Generic copies of countable structures C Ash, J Knight, M Manasse, T Slaman Annals of Pure and Applied Logic 42 (3), 195-205, 1989	178	1989
Randomness and recursive enumerability A Kucera, T Slaman SIAM Journal on Computing 31 (1), 199-211, 2001	159	2001
On the strength of Ramsey's theorem D Seetapun, TA Slaman Notre Dame Journal of Formal Logic 36 (4), 570-582, 1995	134	1995
Relative to any nonrecursive set T Slaman Proceedings of the American Mathematical Society 126 (7), 2117-2122, 1998	104	1998
Definable functions on degrees TA Slaman, JR Steel Cabal Seminar 81–85, 37-55, 1988	104	1988
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	94	1998
Defining the Turing jump RA Shore, TA Slaman Mathematical Research Letters 6 (6), 711-722, 1999	92	1999
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	81	2014
Comparing dnr and wwkl K Ambos-Spies, B Kjos-Hanssen, S Lempp, TA Slaman Journal of Symbolic Logic, 1089-1104, 2004	72	2004
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	64	1994
Definability in the Turing degrees TA Slaman, WH Woodin J. Symbolic Logic, 1986	63	1986
The atomic model theorem and type omitting D Hirschfeldt, R Shore, T Slaman Transactions of the American Mathematical Society 361 (11), 5805-5837, 2009	62	2009
Complementation in the Turing degrees TA Slaman, JR Steel Journal of Symbolic Logic, 160-176, 1989	55	1989
Definability in degree structures TA Slaman, WH Woodin preprint, 2005	53	2005
Σ_ {𝑛}-bounding and Δ_ {𝑛}-induction T Slaman Proceedings of the American Mathematical Society 132 (8), 2449-2456, 2004	53	2004
Working below a high recursively enumerable degree RA Shore, TA Slaman The Journal of Symbolic Logic 58 (3), 824-859, 1993	50	1993
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	49	2008
Working below a low₂ recursively enumerably degree RA Shore, TA Slaman Archive for Mathematical Logic 29 (3), 201-211, 1990	45	1990
Degree structures TA Slaman Proc. Int. Cong. Math., Kyoto, 303-316, 1990	44	1990

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors