Theodore Slaman

Citirano

	Sve	Od 2019.
Citati	3696	742
H-indeks	33	14
i10-indeks	80	24

220

110

165

198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202411 20 15 4 44 33 30 34 49 43 88 49 87 47 57 80 81 82 118 103 145 120 106 131 151 147 190 215 201 209 192 128 145 154 142 115 57

Javni pristup

Prikaži sve

15 članaka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Carl JockuschProfessor Emeritus of Mathematics, University of Illinois at Urbana-ChampaignPotvrđena adresa e-pošte na math.uiuc.edu
Verónica BecherUniversidad de Buenos Aires & CONICETPotvrđena adresa e-pošte na dc.uba.ar
Chi Tat ChongNational UNIVERSITY OF SINGAPOREPotvrđena adresa e-pošte na nus.edu.sg
Jan ReimannAssociate Professor of Mathematics, Pennsylvania State UniversityPotvrđena adresa e-pošte na math.psu.edu
Andre NiesUniversity of AucklandPotvrđena adresa e-pošte na cs.auckland.ac.nz
rod downeyVictoria University, WellingtonPotvrđena adresa e-pošte na vuw.ac.nz
Pablo Ariel HeiberUniversidad de Buenos AiresPotvrđena adresa e-pošte na dc.uba.ar
Antonio MontalbánUniversity of California, BerkeleyPotvrđena adresa e-pošte na berkeley.edu
Bjørn Kjos-HanssenProfessor of Mathematics, University of Hawaii at ManoaPotvrđena adresa e-pošte na hawaii.edu
Mark ManasseChief Cryptographer, i2ChainPotvrđena adresa e-pošte na i2chain.com
Lance FortnowIllinois Institute of TechnologyPotvrđena adresa e-pošte na iit.edu
Stuart KurtzProfessor of Computer Science, The University of ChicagoPotvrđena adresa e-pošte na cs.uchicago.edu
Bakh KhoussainovProfessor, The Algorithms and Logic Group (ALG), UESTCPotvrđena adresa e-pošte na uestc.edu.cn
Wolfgang MaassProfessor of Computer Science, Graz University of TechnologyPotvrđena adresa e-pošte na igi.tugraz.at
Pavel SemukhinLiverpool John Moores UniversityPotvrđena adresa e-pošte na semukhin.name
Andrew MarksUC BerkeleyPotvrđena adresa e-pošte na math.berkeley.edu
Antonín KučeraCharles universityPotvrđena adresa e-pošte na mbox.ms.mff.cuni.cz
Wolfgang MerkleSenior Lecturer, Heidelberg UniversityPotvrđena adresa e-pošte na math.uni-heidelberg.de
Frank StephanNational University of Singapore, Department of Mathematics and Department of Computer SciencePotvrđena adresa e-pošte na comp.nus.edu.sg
Sanjay JainProfessor of Computer Science, National University of SingaporePotvrđena adresa e-pošte na comp.nus.edu.sg

Prati

Theodore Slaman

University of California Berkeley

Potvrđena adresa e-pošte na math.berkeley.edu

Mathematical Logic Recursion Theory


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
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	283	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	208	1989
Randomness and recursive enumerability A Kucera, T Slaman SIAM Journal on Computing 31 (1), 199-211, 2001	165	2001
On the strength of Ramsey's theorem D Seetapun, TA Slaman Notre Dame Journal of Formal Logic 36 (4), 570-582, 1995	151	1995
Definable functions on degrees TA Slaman, JR Steel Cabal Seminar 81–85: Proceedings, Caltech-UCLA Logic Seminar 1981–85, 37-55, 2006	121	2006
Relative to any nonrecursive set T Slaman Proceedings of the American Mathematical Society 126 (7), 2117-2122, 1998	118	1998
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	104	1998
Defining the Turing jump RA Shore, TA Slaman Mathematical Research Letters 6 (6), 711-722, 1999	97	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	91	2014
Comparing dnr and wwkl K Ambos-Spies, B Kjos-Hanssen, S Lempp, TA Slaman The Journal of Symbolic Logic 69 (4), 1089-1104, 2004	76	2004
The atomic model theorem and type omitting D Hirschfeldt, R Shore, T Slaman Transactions of the American Mathematical Society 361 (11), 5805-5837, 2009	73	2009
Definability in the Turing degrees TA Slaman, WH Woodin Illinois Journal of Mathematics 30 (2), 320-334, 1986	71	1986
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	70	1994
Measures and their random reals J Reimann, T Slaman Transactions of the American Mathematical Society 367 (7), 5081-5097, 2015	62	2015
Definability in degree structures TA Slaman, WH Woodin preprint, 2005	61	2005
Σ_ {𝑛}-bounding and Δ_ {𝑛}-induction T Slaman Proceedings of the American Mathematical Society 132 (8), 2449-2456, 2004	58	2004
Complementation in the Turing degrees TA Slaman, JR Steel The Journal of symbolic logic 54 (1), 160-176, 1989	58	1989
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	56	2008
Working below a high recursively enumerable degree RA Shore, TA Slaman The Journal of Symbolic Logic 58 (3), 824-859, 1993	53	1993
Working below a low₂ recursively enumerably degree RA Shore, TA Slaman Archive for Mathematical Logic 29 (3), 201-211, 1990	50	1990

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori