Edit Profile (opens in new tab) Slaman, Theodore A. Compute Distance To: Compute Author ID: slaman.theodore-a Published as: Slaman, Theodore A.; Slaman, Theodore; Slaman, T. A.; Slaman, T. more...less Homepage: https://math.berkeley.edu/~slaman/ External Links: MGP · Wikidata · IdRef Documents Indexed: 118 Publications since 1983 11 Contributions as Editor Co-Authors: 73 Co-Authors with 110 Joint Publications 1,106 Co-Co-Authors all top 5 Co-Authors 19 single-authored 12 Shore, Richard Arnold 12 Woodin, W. Hugh 11 Chong, Chi Tat 10 Lempp, Steffen 9 Yang, Yue 8 Becher, Verónica 6 Feng, Qi 6 Groszek, Marcia J. 5 Maass, Wolfgang 4 Cholak, Peter A. 4 Greenberg, Noam 4 Jockusch, Carl G. jun. 4 Mytilinaios, Michael E. 4 Shinoda, Juichi 4 Steel, John R. 3 Ambos-Spies, Klaus 3 Downey, Rodney Graham 3 Heiber, Pablo Ariel 3 Hirschfeldt, Denis Roman 3 Kučera, Antonín 3 Montalbán, Antonio 3 Nies, André Otfrid 3 Reimann, Jan 3 Soare, Robert I. 3 Sorbi, Andrea 3 Soskova, Mariya Ivanova 2 Barmpalias, George 2 Bugeaud, Yann 2 Cai, Mingzhong 2 Harrington, Leo A. 2 Khoussainov, Bakhadyr M. 2 Kjos-Hanssen, Bjørn 2 Knight, Julia F. 2 Merkle, Wolfgang 2 Mihailović, Nenad 2 Sacks, Gerald Enoch 1 Aistleitner, Christoph 1 Allen, Kelty 1 Arslanov, Marat M. 1 Ash, Chris 1 Ash, Christopher John 1 Bienvenu, Laurent 1 Calhoun, William C. 1 Coles, Richard J. 1 Conidis, Chris J. 1 Cooper, Stuart Barry 1 Dorais, François Gilbert 1 Dzhafarov, Damir D. 1 Evans, Zachary 1 Fortnow, Lance J. 1 Gasarch, William Ian 1 Harris, Seth 1 Haught, Christine Ann 1 Hinman, Peter G. 1 Hirst, Jeffry Lynn 1 Jain, Sanjay 1 Kinber, Efim B. 1 Kummer, Martin 1 Kurtz, Stuart A. 1 LaForte, Geoffrey L. 1 Lerman, Manuel 1 Manasse, Mark S. 1 Marks, Andrew S. 1 Pleszkovich, Mark 1 Qian, Lei 1 Scheerer, Adrian-Maria 1 Seetapun, David 1 Semukhin, Pavel 1 Solovay, Robert M. 1 Stephan, Frank 1 Todorcevic, Stevo B. 1 Tugué, Tosiyuki 1 Wainer, Stanley Scott 1 Yokoyama, Keita all top 5 Serials 20 The Journal of Symbolic Logic 12 Annals of Pure and Applied Logic 7 Lecture Notes Series. Institute for Mathematical Sciences. National University of Singapore 6 Proceedings of the American Mathematical Society 5 Transactions of the American Mathematical Society 5 Journal of Mathematical Logic 4 Advances in Mathematics 4 The Bulletin of Symbolic Logic 3 Fundamenta Mathematicae 3 Archive for Mathematical Logic 2 Israel Journal of Mathematics 2 Journal of Computer and System Sciences 2 Journal of the London Mathematical Society. Second Series 2 Notre Dame Journal of Formal Logic 2 Proceedings of the London Mathematical Society. Third Series 2 Journal of the American Mathematical Society 1 Mathematics of Computation 1 Acta Arithmetica 1 Annali di Matematica Pura ed Applicata. Serie Quarta 1 Illinois Journal of Mathematics 1 Mathematische Annalen 1 Monatshefte für Mathematik 1 Nagoya Mathematical Journal 1 SIAM Journal on Computing 1 Theoretical Computer Science 1 Information and Computation 1 International Journal of Algebra and Computation 1 Proceedings of the National Academy of Sciences of the United States of America 1 New Zealand Journal of Mathematics 1 Mathematical Research Letters 1 Theory of Computing Systems 1 Annals of Mathematics. Second Series 1 Lecture Notes in Mathematics 1 London Mathematical Society Lecture Note Series 1 Journal of Logic and Analysis all top 5 Fields 125 Mathematical logic and foundations (03-XX) 20 Computer science (68-XX) 9 General and overarching topics; collections (00-XX) 8 Number theory (11-XX) 5 Combinatorics (05-XX) 4 Probability theory and stochastic processes (60-XX) 2 History and biography (01-XX) 2 Order, lattices, ordered algebraic structures (06-XX) 2 Measure and integration (28-XX) 1 Functional analysis (46-XX) 1 General topology (54-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 98 Publications have been cited 1,059 times in 653 Documents Cited by ▼ Year ▼ On the strength of Ramsey’s theorem for pairs. Zbl 0977.03033Cholak, Peter A.; Jockusch, Carl G.; Slaman, Theodore A. 101 2001 Generic copies of countable structures. Zbl 0678.03012Ash, Chris; Knight, Julia; Manasse, Mark; Slaman, Theodore 66 1989 On the strength of Ramsey’s theorem. Zbl 0843.03034Seetapun, David; Slaman, Theodore A. 58 1995 Randomness and recursive enumerability. Zbl 0992.68079Kucera, Antonín; Slaman, T. 48 2001 Slicing the truth. On the computable and reverse mathematics of combinatorial principles. Zbl 1304.03001Hirschfeldt, Denis R. 38 2014 Interpretability and definability in the recursively enumerable degrees. Zbl 0904.03028Nies, André; Shore, Richard A.; Slaman, Theodore A. 37 1998 Relative to any nonrecursive set. Zbl 0894.03017Slaman, Theodore A. 35 1998 The metamathematics of stable Ramsey’s theorem for pairs. Zbl 1341.03015Chong, C. T.; Slaman, Theodore A.; Yang, Yue 34 2014 The atomic model theorem and type omitting. Zbl 1184.03005Hirschfeldt, Denis R.; Shore, Richard A.; Slaman, Theodore A. 30 2009 Defining the Turing jump. Zbl 0958.03029Shore, Richard A.; Slaman, Theodore A. 30 1999 Comparing DNR and WWKL. Zbl 1076.03039Ambos-Spies, Klaus; Kjos-Hanssen, Bjørn; Lempp, Steffen; Slaman, Theodore A. 27 2004 \(\Sigma_n\)-bounding and \(\Delta_n\)-induction. Zbl 1053.03034Slaman, Theodore A. 24 2004 Definability in the Turing degrees. Zbl 0592.03030Slaman, Theodore A.; Woodin, W. Hugh 23 1986 Definability in the enumeration degrees. Zbl 0906.03043Slaman, Theodore A.; Woodin, W. Hugh 21 1997 Extremes in the degrees of inferability. Zbl 0813.03026Fortnow, Lance; Gasarch, William; Jain, Sanjay; Kinber, Efim; Kummer, Martin; Kurtz, Stuart; Pleszkovich, Mark; Slaman, Theodore; Solovay, Robert; Stephan, Frank 20 1994 Measures and their random reals. Zbl 1375.03050Reimann, Jan; Slaman, Theodore A. 19 2015 The density of infima in the recursively enumerable degrees. Zbl 0732.03034Slaman, Theodore A. 17 1991 Working below a \(low_ 2\) recursively enumerable degree. Zbl 0693.03027Shore, Richard A.; Slaman, Theodore A. 16 1990 \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey’s theorem for pairs. Zbl 1255.03025Chong, C. T.; Slaman, Theodore A.; Yang, Yue 16 2012 The \(\Pi_{3}\)-theory of the computably enumerable Turing degrees is undecidable. Zbl 0904.03029Lempp, Steffen; Nies, André; Slaman, Theodore A. 15 1998 The strength of some combinatorial principles related to Ramsey’s theorem for pairs. Zbl 1167.03009Hirschfeldt, Denis R.; Jockusch, Carl G. jun.; Kjos-Hanssen, Bjørn; Lempp, Steffen; Slaman, Theodore A. 15 2008 A polynomial-time algorithm for computing absolutely normal numbers. Zbl 1315.03075Becher, Verónica; Heiber, Pablo Ariel; Slaman, Theodore A. 15 2013 Completely mitotic r. e. degrees. Zbl 0628.03028Downey, R. G.; Slaman, T. A. 14 1989 Definable functions on degrees. Zbl 0677.03038Slaman, Theodore A.; Steel, John R. 14 1988 Corrigendum to: “On the strength of Ramsey’s theorem for pairs”. Zbl 1182.03107Cholak, Peter A.; Jockusch, Carl G. jun.; Slaman, Theodore A. 14 2009 Complementation in the Turing degrees. Zbl 0691.03024Slaman, Theodore A.; Steel, John R. 13 1989 Extension of embeddings in the computably enumerable degrees. Zbl 0988.03063Slaman, Theodore A.; Soare, Robert I. 12 2001 Working below a high recursively enumerable degree. Zbl 0797.03043Shore, Richard A.; Slaman, Theodore A. 11 1993 Relative enumerability in the difference hierarchy. Zbl 0911.03021Arslanov, Marat M.; LaForte, Geoffrey L.; Slaman, Theodore A. 11 1998 Every set has a least jump enumeration. Zbl 1023.03036Coles, Richard J.; Downey, Rod G.; Slaman, Theodore A. 11 2000 On the normality of numbers to different bases. Zbl 1372.11078Becher, Verónica; Slaman, Theodore A. 11 2014 Relative to any non-hyperarithmetic set. Zbl 1308.03050Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A. 11 2013 On the theory of the PTIME degrees of the recursive sets. Zbl 0715.68040Shinoda, Juichi; Slaman, Theodore A. 10 1990 The inductive strength of Ramsey’s theorem for pairs. Zbl 1423.03047Chong, C. T.; Slaman, Theodore A.; Yang, Yue 10 2017 Generics for computable Mathias forcing. Zbl 1320.03072Cholak, Peter A.; Dzhafarov, Damir D.; Hirst, Jeffry L.; Slaman, Theodore A. 10 2014 \(\Sigma_ 2\)-collection and the infinite injury priority method. Zbl 0645.03039Mytilinaios, Michael E.; Slaman, Theodore A. 10 1988 The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory. Zbl 0774.03028Shore, Richard A.; Slaman, Theodore A. 9 1992 An almost deep degree. Zbl 0992.03049Cholak, Peter; Groszek, Marcia; Slaman, Theodore 8 2001 Random reals, the rainbow Ramsey theorem, and arithmetic conservation. Zbl 1305.03055Conidis, Chris J.; Slaman, Theodore A. 8 2013 Notes on forcing axioms. Zbl 1294.03007Todorcevic, Stevo 8 2014 Independence results on the global structure of the Turing degrees. Zbl 0528.03027Groszek, Marcia J.; Slaman, Theodore A. 7 1983 \(\Pi^0_1\)-presentations of algebras. Zbl 1099.03025Khoussainov, Bakhadyr; Slaman, Theodore; Semukhin, Pavel 7 2006 Turing incomparability in Scott sets. Zbl 1123.03039Kucera, Antonín; Slaman, Theodore A. 7 2007 Global properties of the Turing degrees and the Turing jump. Zbl 1160.03023Slaman, Theodore A. 7 2008 Normal numbers and the Borel hierarchy. Zbl 1316.03024Becher, Verónica; Heiber, Pablo Ariel; Slaman, Theodore A. 7 2014 A limit on relative genericity in the recursively enumerable sets. Zbl 0699.03023Lempp, Steffen; Slaman, Theodore A. 6 1989 Some results on effective randomness. Zbl 1100.03034Merkle, Wolfgang; Mihailovic, Nenad; Slaman, Theodore A. 6 2006 Algebraic aspects of the computably enumerable degrees. Zbl 0812.03021Slaman, Theodore A.; Soare, Robert I. 6 1995 A basis theorem for perfect sets. Zbl 0937.03058Groszek, Marcia J.; Slaman, Theodore A. 6 1998 On the \({\Sigma}_ 2\)-theory of the upper semilattice of Turing degrees. Zbl 0848.03021Jockusch, Carl G. jun.; Slaman, Theodore A. 6 1993 The Sacks density theorem and \(\Sigma_ 2\)-bounding. Zbl 0858.03047Groszek, Marcia J.; Mytilinaios, Michael E.; Slaman, Theodore A. 6 1996 The complexity of the index sets of \(\aleph_0\)-categorical theories and of Ehrenfeucht theories. Zbl 1123.03035Lempp, Steffen; Slaman, Theodore A. 6 2007 On extensions of embeddings into the enumeration degrees of the \({\Sigma_2^0}\)-sets. Zbl 1097.03036Lempp, Steffen; Slaman, Theodore A.; Sorbi, Andrea 5 2005 Degree structures. Zbl 0753.03018Slaman, Theodore A. 5 1991 The \(\Pi_ 2^ 0\) enumeration degrees are not dense. Zbl 0874.03054Calhoun, William C.; Slaman, Theodore A. 5 1996 Definability in the recursively enumerable degrees. Zbl 0874.03052Nies, André; Shore, Richard A.; Slaman, Theodore A. 5 1996 Jump embeddings in the Turing degrees. Zbl 0745.03036Hinman, Peter G.; Slaman, Theodore A. 5 1991 On zeros of Martin-Löf random Brownian motion. Zbl 1346.03044Bienvenu, Laurent; Allen, Kelty; Slaman, Theodore A. 5 2014 A splitting theorem for \(n\)-REA degrees. Zbl 0993.03054Shore, Richard A.; Slaman, Theodore A. 5 2001 A computable absolutely normal Liouville number. Zbl 1323.11058Becher, Verónica; Heiber, Pablo Ariel; Slaman, Theodore A. 5 2015 The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures. Zbl 1253.03068Cai, Mingzhong; Shore, Richard A.; Slaman, Theodore A. 5 2012 The irrationality exponents of computable numbers. Zbl 1336.11053Becher, Verónica; Bugeaud, Yann; Slaman, Theodore A. 5 2016 Martin’s conjecture, arithmetic equivalence, and countable Borel equivalence relations. Zbl 1431.03061Marks, Andrew; Slaman, Theodore A.; Steel, John R. 5 2016 \(\Sigma\) \({}_ 1\)-collection and the finite injury priority method. Zbl 0702.03035Slaman, Theodore A.; Woodin, W. Hugh 4 1989 Computably enumerable algebras, their expansions, and isomorphisms. Zbl 1096.03050Khoussainov, Bakhadyr; Lempp, Steffen; Slaman, Theodore A. 4 2005 The Slaman-Wehner theorem in higher recursion theory. Zbl 1237.03020Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A. 4 2011 Low upper bounds of ideals. Zbl 1168.68021Kučera, Antonín; Slaman, Theodore A. 4 2009 The E-recursively enumerable degrees are dense. Zbl 0574.03033Slaman, Theodore A. 3 1985 Reflection and forcing in E-recursion theory. Zbl 0574.03034Slaman, Theodore A. 3 1985 Aspects of the Turing jump. Zbl 1086.03032Slaman, Theodore A. 3 2005 Extending partial orders to dense linear orders. Zbl 0924.03094Slaman, Theodore A.; Woodin, W. Hugh 3 1998 On the construction of absolutely normal numbers. Zbl 1429.11133Aistleitner, Christoph; Becher, Verónica; Scheerer, Adrian-Maria; Slaman, Theodore A. 3 2017 On the existence of a strong minimal pair. Zbl 1386.03044Barmpalias, George; Cai, Mingzhong; Lempp, Steffen; Slaman, Theodore A. 3 2015 On simply normal numbers to different bases. Zbl 1343.11065Becher, Verónica; Bugeaud, Yann; Slaman, Theodore A. 3 2016 Inadmissible forcing. Zbl 0645.03046Sacks, G. E.; Slaman, T. A. 3 1987 \(K\)-trivials are never continuously random. Zbl 1296.03022Barmpalias, George; Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A. 3 2012 \(\Sigma\)\( _ 1\) definitions with parameters. Zbl 0629.03022Slaman, T. A. 2 1986 Recursive in a generic real. Zbl 0960.03040Shinoda, Juichi; Slaman, Theodore A. 2 2000 Relatively recursive expansions. II. Zbl 0809.03024Ash, C. J.; Knight, J. F.; Slaman, T. A. 2 1993 Automorphisms in the PTIME-Turing degrees of recursive sets. Zbl 0865.03034Haught, Christine Ann; Slaman, Theodore A. 2 1997 \(\Pi_1^0\) classes and minimal degrees. Zbl 0952.03051Groszek, Marcia J.; Slaman, Theodore A. 2 1997 Computability, enumerability, unsolvability. Directions in recursion theory. Zbl 0830.00006 2 1996 A note on initial segments of the enumeration degrees. Zbl 1337.03060Slaman, Theodore A.; Sorbi, Andrea 2 2014 \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield’s conjecture. Zbl 0976.03049Chong, C. T.; Qian, Lei; Slaman, Theodore A.; Yang, Yue 2 2001 The \(\forall\exists\) theory of \({\mathcal D}(\leq,\vee,{}')\) is undecidable. Zbl 1108.03047Shore, Richard A.; Slaman, Theodore A. 1 2006 The strength of Ramsey’s theorem for pairs and arbitrarily many colors. Zbl 1436.03098Slaman, Theodore A.; Yokoyama, Keita 1 2018 The extended plus-one hypothesis - a relative consistency result. Zbl 0549.03033Slaman, Theodore A. 1 1983 On co-simple isols and their intersection types. Zbl 0773.03031Downey, Rod; Slaman, Theodore A. 1 1992 Differences between resource bounded degree structures. Zbl 1068.03034Mytilinaios, Michael E.; Slaman, Theodore A. 1 2003 Quasi-minimal enumeration degrees and minimal Turing degrees. Zbl 0957.03049Slaman, Theodore A.; Sorbi, A. 1 1998 Conference on computability theory. Proceedings of the conference, Oberwolfach, Germany, January 27–February 3, 1996. Zbl 0922.00014 1 1998 On a question of Brown and Simpson. Zbl 0835.03026Mytilinaios, Michael E.; Slaman, Theodore A. 1 1996 Mathematical definability. Zbl 0932.03054Slaman, Theodore A. 1 1998 Extensional properties of sets of time bounded complexity. Zbl 0756.68043Maass, Wolfgang; Slaman, Theodore A. 1 1989 Effective randomness for continuous measures. Zbl 07485050Reimann, Jan; Slaman, Theodore A. 1 2022 The enumeration degrees: local and global structural interactions. Zbl 1420.03097Slaman, Theodore A.; Soskova, Mariya I. 1 2017 The \(\Delta ^0_2\) Turing degrees: automorphisms and definability. Zbl 1445.03047Slaman, Theodore A.; Soskova, Mariya I. 1 2018 The theory of the metarecursively enumerable degrees. Zbl 1109.03040Greenberg, Noam; Shore, Richard A.; Slaman, Theodore A. 1 2006 Effective randomness for continuous measures. Zbl 07485050Reimann, Jan; Slaman, Theodore A. 1 2022 The strength of Ramsey’s theorem for pairs and arbitrarily many colors. Zbl 1436.03098Slaman, Theodore A.; Yokoyama, Keita 1 2018 The \(\Delta ^0_2\) Turing degrees: automorphisms and definability. Zbl 1445.03047Slaman, Theodore A.; Soskova, Mariya I. 1 2018 The inductive strength of Ramsey’s theorem for pairs. Zbl 1423.03047Chong, C. T.; Slaman, Theodore A.; Yang, Yue 10 2017 On the construction of absolutely normal numbers. Zbl 1429.11133Aistleitner, Christoph; Becher, Verónica; Scheerer, Adrian-Maria; Slaman, Theodore A. 3 2017 The enumeration degrees: local and global structural interactions. Zbl 1420.03097Slaman, Theodore A.; Soskova, Mariya I. 1 2017 The irrationality exponents of computable numbers. Zbl 1336.11053Becher, Verónica; Bugeaud, Yann; Slaman, Theodore A. 5 2016 Martin’s conjecture, arithmetic equivalence, and countable Borel equivalence relations. Zbl 1431.03061Marks, Andrew; Slaman, Theodore A.; Steel, John R. 5 2016 On simply normal numbers to different bases. Zbl 1343.11065Becher, Verónica; Bugeaud, Yann; Slaman, Theodore A. 3 2016 Measures and their random reals. Zbl 1375.03050Reimann, Jan; Slaman, Theodore A. 19 2015 A computable absolutely normal Liouville number. Zbl 1323.11058Becher, Verónica; Heiber, Pablo Ariel; Slaman, Theodore A. 5 2015 On the existence of a strong minimal pair. Zbl 1386.03044Barmpalias, George; Cai, Mingzhong; Lempp, Steffen; Slaman, Theodore A. 3 2015 Slicing the truth. On the computable and reverse mathematics of combinatorial principles. Zbl 1304.03001Hirschfeldt, Denis R. 38 2014 The metamathematics of stable Ramsey’s theorem for pairs. Zbl 1341.03015Chong, C. T.; Slaman, Theodore A.; Yang, Yue 34 2014 On the normality of numbers to different bases. Zbl 1372.11078Becher, Verónica; Slaman, Theodore A. 11 2014 Generics for computable Mathias forcing. Zbl 1320.03072Cholak, Peter A.; Dzhafarov, Damir D.; Hirst, Jeffry L.; Slaman, Theodore A. 10 2014 Notes on forcing axioms. Zbl 1294.03007Todorcevic, Stevo 8 2014 Normal numbers and the Borel hierarchy. Zbl 1316.03024Becher, Verónica; Heiber, Pablo Ariel; Slaman, Theodore A. 7 2014 On zeros of Martin-Löf random Brownian motion. Zbl 1346.03044Bienvenu, Laurent; Allen, Kelty; Slaman, Theodore A. 5 2014 A note on initial segments of the enumeration degrees. Zbl 1337.03060Slaman, Theodore A.; Sorbi, Andrea 2 2014 A polynomial-time algorithm for computing absolutely normal numbers. Zbl 1315.03075Becher, Verónica; Heiber, Pablo Ariel; Slaman, Theodore A. 15 2013 Relative to any non-hyperarithmetic set. Zbl 1308.03050Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A. 11 2013 Random reals, the rainbow Ramsey theorem, and arithmetic conservation. Zbl 1305.03055Conidis, Chris J.; Slaman, Theodore A. 8 2013 \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey’s theorem for pairs. Zbl 1255.03025Chong, C. T.; Slaman, Theodore A.; Yang, Yue 16 2012 The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures. Zbl 1253.03068Cai, Mingzhong; Shore, Richard A.; Slaman, Theodore A. 5 2012 \(K\)-trivials are never continuously random. Zbl 1296.03022Barmpalias, George; Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A. 3 2012 The Slaman-Wehner theorem in higher recursion theory. Zbl 1237.03020Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A. 4 2011 The atomic model theorem and type omitting. Zbl 1184.03005Hirschfeldt, Denis R.; Shore, Richard A.; Slaman, Theodore A. 30 2009 Corrigendum to: “On the strength of Ramsey’s theorem for pairs”. Zbl 1182.03107Cholak, Peter A.; Jockusch, Carl G. jun.; Slaman, Theodore A. 14 2009 Low upper bounds of ideals. Zbl 1168.68021Kučera, Antonín; Slaman, Theodore A. 4 2009 The strength of some combinatorial principles related to Ramsey’s theorem for pairs. Zbl 1167.03009Hirschfeldt, Denis R.; Jockusch, Carl G. jun.; Kjos-Hanssen, Bjørn; Lempp, Steffen; Slaman, Theodore A. 15 2008 Global properties of the Turing degrees and the Turing jump. Zbl 1160.03023Slaman, Theodore A. 7 2008 Turing incomparability in Scott sets. Zbl 1123.03039Kucera, Antonín; Slaman, Theodore A. 7 2007 The complexity of the index sets of \(\aleph_0\)-categorical theories and of Ehrenfeucht theories. Zbl 1123.03035Lempp, Steffen; Slaman, Theodore A. 6 2007 \(\Pi^0_1\)-presentations of algebras. Zbl 1099.03025Khoussainov, Bakhadyr; Slaman, Theodore; Semukhin, Pavel 7 2006 Some results on effective randomness. Zbl 1100.03034Merkle, Wolfgang; Mihailovic, Nenad; Slaman, Theodore A. 6 2006 The \(\forall\exists\) theory of \({\mathcal D}(\leq,\vee,{}')\) is undecidable. Zbl 1108.03047Shore, Richard A.; Slaman, Theodore A. 1 2006 The theory of the metarecursively enumerable degrees. Zbl 1109.03040Greenberg, Noam; Shore, Richard A.; Slaman, Theodore A. 1 2006 On extensions of embeddings into the enumeration degrees of the \({\Sigma_2^0}\)-sets. Zbl 1097.03036Lempp, Steffen; Slaman, Theodore A.; Sorbi, Andrea 5 2005 Computably enumerable algebras, their expansions, and isomorphisms. Zbl 1096.03050Khoussainov, Bakhadyr; Lempp, Steffen; Slaman, Theodore A. 4 2005 Aspects of the Turing jump. Zbl 1086.03032Slaman, Theodore A. 3 2005 Comparing DNR and WWKL. Zbl 1076.03039Ambos-Spies, Klaus; Kjos-Hanssen, Bjørn; Lempp, Steffen; Slaman, Theodore A. 27 2004 \(\Sigma_n\)-bounding and \(\Delta_n\)-induction. Zbl 1053.03034Slaman, Theodore A. 24 2004 Differences between resource bounded degree structures. Zbl 1068.03034Mytilinaios, Michael E.; Slaman, Theodore A. 1 2003 On the strength of Ramsey’s theorem for pairs. Zbl 0977.03033Cholak, Peter A.; Jockusch, Carl G.; Slaman, Theodore A. 101 2001 Randomness and recursive enumerability. Zbl 0992.68079Kucera, Antonín; Slaman, T. 48 2001 Extension of embeddings in the computably enumerable degrees. Zbl 0988.03063Slaman, Theodore A.; Soare, Robert I. 12 2001 An almost deep degree. Zbl 0992.03049Cholak, Peter; Groszek, Marcia; Slaman, Theodore 8 2001 A splitting theorem for \(n\)-REA degrees. Zbl 0993.03054Shore, Richard A.; Slaman, Theodore A. 5 2001 \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield’s conjecture. Zbl 0976.03049Chong, C. T.; Qian, Lei; Slaman, Theodore A.; Yang, Yue 2 2001 Every set has a least jump enumeration. Zbl 1023.03036Coles, Richard J.; Downey, Rod G.; Slaman, Theodore A. 11 2000 Recursive in a generic real. Zbl 0960.03040Shinoda, Juichi; Slaman, Theodore A. 2 2000 Defining the Turing jump. Zbl 0958.03029Shore, Richard A.; Slaman, Theodore A. 30 1999 Interpretability and definability in the recursively enumerable degrees. Zbl 0904.03028Nies, André; Shore, Richard A.; Slaman, Theodore A. 37 1998 Relative to any nonrecursive set. Zbl 0894.03017Slaman, Theodore A. 35 1998 The \(\Pi_{3}\)-theory of the computably enumerable Turing degrees is undecidable. Zbl 0904.03029Lempp, Steffen; Nies, André; Slaman, Theodore A. 15 1998 Relative enumerability in the difference hierarchy. Zbl 0911.03021Arslanov, Marat M.; LaForte, Geoffrey L.; Slaman, Theodore A. 11 1998 A basis theorem for perfect sets. Zbl 0937.03058Groszek, Marcia J.; Slaman, Theodore A. 6 1998 Extending partial orders to dense linear orders. Zbl 0924.03094Slaman, Theodore A.; Woodin, W. Hugh 3 1998 Quasi-minimal enumeration degrees and minimal Turing degrees. Zbl 0957.03049Slaman, Theodore A.; Sorbi, A. 1 1998 Conference on computability theory. Proceedings of the conference, Oberwolfach, Germany, January 27–February 3, 1996. Zbl 0922.00014 1 1998 Mathematical definability. Zbl 0932.03054Slaman, Theodore A. 1 1998 Definability in the enumeration degrees. Zbl 0906.03043Slaman, Theodore A.; Woodin, W. Hugh 21 1997 Automorphisms in the PTIME-Turing degrees of recursive sets. Zbl 0865.03034Haught, Christine Ann; Slaman, Theodore A. 2 1997 \(\Pi_1^0\) classes and minimal degrees. Zbl 0952.03051Groszek, Marcia J.; Slaman, Theodore A. 2 1997 The Sacks density theorem and \(\Sigma_ 2\)-bounding. Zbl 0858.03047Groszek, Marcia J.; Mytilinaios, Michael E.; Slaman, Theodore A. 6 1996 The \(\Pi_ 2^ 0\) enumeration degrees are not dense. Zbl 0874.03054Calhoun, William C.; Slaman, Theodore A. 5 1996 Definability in the recursively enumerable degrees. Zbl 0874.03052Nies, André; Shore, Richard A.; Slaman, Theodore A. 5 1996 Computability, enumerability, unsolvability. Directions in recursion theory. Zbl 0830.00006 2 1996 On a question of Brown and Simpson. Zbl 0835.03026Mytilinaios, Michael E.; Slaman, Theodore A. 1 1996 On the strength of Ramsey’s theorem. Zbl 0843.03034Seetapun, David; Slaman, Theodore A. 58 1995 Algebraic aspects of the computably enumerable degrees. Zbl 0812.03021Slaman, Theodore A.; Soare, Robert I. 6 1995 Extremes in the degrees of inferability. Zbl 0813.03026Fortnow, Lance; Gasarch, William; Jain, Sanjay; Kinber, Efim; Kummer, Martin; Kurtz, Stuart; Pleszkovich, Mark; Slaman, Theodore; Solovay, Robert; Stephan, Frank 20 1994 Working below a high recursively enumerable degree. Zbl 0797.03043Shore, Richard A.; Slaman, Theodore A. 11 1993 On the \({\Sigma}_ 2\)-theory of the upper semilattice of Turing degrees. Zbl 0848.03021Jockusch, Carl G. jun.; Slaman, Theodore A. 6 1993 Relatively recursive expansions. II. Zbl 0809.03024Ash, C. J.; Knight, J. F.; Slaman, T. A. 2 1993 The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory. Zbl 0774.03028Shore, Richard A.; Slaman, Theodore A. 9 1992 On co-simple isols and their intersection types. Zbl 0773.03031Downey, Rod; Slaman, Theodore A. 1 1992 The density of infima in the recursively enumerable degrees. Zbl 0732.03034Slaman, Theodore A. 17 1991 Degree structures. Zbl 0753.03018Slaman, Theodore A. 5 1991 Jump embeddings in the Turing degrees. Zbl 0745.03036Hinman, Peter G.; Slaman, Theodore A. 5 1991 Working below a \(low_ 2\) recursively enumerable degree. Zbl 0693.03027Shore, Richard A.; Slaman, Theodore A. 16 1990 On the theory of the PTIME degrees of the recursive sets. Zbl 0715.68040Shinoda, Juichi; Slaman, Theodore A. 10 1990 Generic copies of countable structures. Zbl 0678.03012Ash, Chris; Knight, Julia; Manasse, Mark; Slaman, Theodore 66 1989 Completely mitotic r. e. degrees. Zbl 0628.03028Downey, R. G.; Slaman, T. A. 14 1989 Complementation in the Turing degrees. Zbl 0691.03024Slaman, Theodore A.; Steel, John R. 13 1989 A limit on relative genericity in the recursively enumerable sets. Zbl 0699.03023Lempp, Steffen; Slaman, Theodore A. 6 1989 \(\Sigma\) \({}_ 1\)-collection and the finite injury priority method. Zbl 0702.03035Slaman, Theodore A.; Woodin, W. Hugh 4 1989 Extensional properties of sets of time bounded complexity. Zbl 0756.68043Maass, Wolfgang; Slaman, Theodore A. 1 1989 Definable functions on degrees. Zbl 0677.03038Slaman, Theodore A.; Steel, John R. 14 1988 \(\Sigma_ 2\)-collection and the infinite injury priority method. Zbl 0645.03039Mytilinaios, Michael E.; Slaman, Theodore A. 10 1988 Inadmissible forcing. Zbl 0645.03046Sacks, G. E.; Slaman, T. A. 3 1987 Definability in the Turing degrees. Zbl 0592.03030Slaman, Theodore A.; Woodin, W. Hugh 23 1986 \(\Sigma\)\( _ 1\) definitions with parameters. Zbl 0629.03022Slaman, T. A. 2 1986 The E-recursively enumerable degrees are dense. Zbl 0574.03033Slaman, Theodore A. 3 1985 Reflection and forcing in E-recursion theory. Zbl 0574.03034Slaman, Theodore A. 3 1985 Independence results on the global structure of the Turing degrees. Zbl 0528.03027Groszek, Marcia J.; Slaman, Theodore A. 7 1983 The extended plus-one hypothesis - a relative consistency result. Zbl 0549.03033Slaman, Theodore A. 1 1983 all cited Publications top 5 cited Publications all top 5 Cited by 394 Authors 44 Downey, Rodney Graham 42 Slaman, Theodore A. 38 Shore, Richard Arnold 30 Stephan, Frank 25 Nies, André Otfrid 24 Patey, Ludovic 20 Greenberg, Noam 20 Montalbán, Antonio 19 Lempp, Steffen 17 Miller, Joseph S. 16 Chong, Chi Tat 16 Hirschfeldt, Denis Roman 15 Barmpalias, George 15 Dzhafarov, Damir D. 15 Solomon, Reed 15 Yang, Yue 14 Kalimullin, Iskander Shagitovich 13 Bazhenov, Nikolaĭ Alekseevich 13 Miller, Russell G. 12 Cholak, Peter A. 12 Harrison-Trainor, Matthew 12 Kjos-Hanssen, Bjørn 12 Knight, Julia F. 12 Soskova, Mariya Ivanova 11 Calude, Cristian S. 11 Ganchev, Hristo A. 10 Cai, Mingzhong 10 Harizanov, Valentina S. 10 Jain, Sanjay 10 Jockusch, Carl G. jun. 10 Melnikov, Alexander G. 10 Simpson, Stephen G. 10 Sorbi, Andrea 10 Wu, Guohua 9 Bienvenu, Laurent 9 Cooper, Stuart Barry 9 Li, Angsheng 9 Yokoyama, Keita 9 Yu, Liang 8 Arslanov, Marat M. 8 Becher, Verónica 8 Kreuzer, Alexander P. 8 Lewis, Andrew E. M. 8 Ng, KengMeng 8 Shafer, Paul 7 Hirst, Jeffry Lynn 7 Kasymov, Nadimulla Khabibullaevich 7 Khoussainov, Bakhadyr M. 7 Yamaleev, Mars Mansurovich 6 Csima, Barbara F. 6 Hölzl, Rupert 6 Kihara, Takayuki 6 Lerman, Manuel 6 Monin, Benoît 6 Rute, Jason 6 Wang, Wei 6 Westrick, Linda Brown 5 Ambos-Spies, Klaus 5 Andrews, Uri 5 Cenzer, Douglas 5 Day, Adam R. 5 Dorais, François Gilbert 5 Fokina, Ekaterina B. 5 Goncharov, Sergeĭ Savost’yanovich 5 Lewis-Pye, Andrew E. M. 5 Li, Wei 5 Merkle, Wolfgang 5 Mileti, Joseph R. 5 Reimann, Jan 5 Tadaki, Kohtaro 5 Turetsky, Dan 4 Airey, Dylan 4 Carlucci, Lorenzo 4 Conidis, Chris J. 4 Ding, Decheng 4 Figueira, Santiago 4 Griffiths, Evan J. 4 Groszek, Marcia J. 4 Kent, Thomas F. 4 Kinber, Efim B. 4 Kołodziejczyk, Leszek Aleksander 4 Liu, Lu 4 Mance, Bill 4 Marcone, Alberto 4 Morozov, Andreĭ Sergeevich 4 Sariev, Andrey C. 4 Shinoda, Juichi 3 Ash, Christopher John 3 Bélanger, David R. 3 Beros, Achilles A. 3 Binns, Stephen 3 Brattka, Vasco 3 Buss, Samuel R. 3 Dadazhanov, Ruzmat Normatovich 3 Flood, Stephen P. 3 Khan, Mushfeq 3 Korovina, Margarita Vladimirovna 3 Kudinov, Oleg Victorovich 3 Lange, Karen 3 McCoy, Charles F. D. ...and 294 more Authors all top 5 Cited in 69 Serials 95 Annals of Pure and Applied Logic 89 The Journal of Symbolic Logic 40 Archive for Mathematical Logic 40 The Bulletin of Symbolic Logic 35 Transactions of the American Mathematical Society 25 Journal of Mathematical Logic 24 Proceedings of the American Mathematical Society 24 Theoretical Computer Science 18 Notre Dame Journal of Formal Logic 18 Mathematical Logic Quarterly (MLQ) 17 Algebra and Logic 16 Israel Journal of Mathematics 16 Journal of Computer and System Sciences 15 Advances in Mathematics 12 Information and Computation 10 Theory of Computing Systems 7 Lobachevskii Journal of Mathematics 6 Siberian Mathematical Journal 5 Godishnik na Sofiĭskiya Universitet “Sv. Kliment Okhridski”. Fakultet po Matematika i Informatika 5 Journal of Mathematical Sciences (New York) 5 Computability 4 Russian Mathematics 3 Mathematics of Computation 3 Fundamenta Mathematicae 3 Journal of Algebra 3 Memoirs of the American Mathematical Society 3 Journal of the American Mathematical Society 3 MSCS. Mathematical Structures in Computer Science 3 Sibirskie Èlektronnye Matematicheskie Izvestiya 3 Proceedings of the Steklov Institute of Mathematics 2 Studia Logica 2 Journal of Complexity 2 Experimental Mathematics 2 Philosophical Transactions of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences 2 Logical Methods in Computer Science 2 Forum of Mathematics, Sigma 1 Information Processing Letters 1 Mathematical Notes 1 Mathematical Proceedings of the Cambridge Philosophical Society 1 Chaos, Solitons and Fractals 1 Theory of Probability and its Applications 1 Acta Arithmetica 1 Canadian Journal of Mathematics 1 Inventiones Mathematicae 1 Mathematische Annalen 1 Monatshefte für Mathematik 1 Nagoya Mathematical Journal 1 Synthese 1 Tôhoku Mathematical Journal. Second Series 1 Topology and its Applications 1 Journal of Computer Science and Technology 1 Journal of Theoretical Probability 1 Science in China. Series A 1 Sugaku Expositions 1 Stochastic Processes and their Applications 1 Bulletin of the American Mathematical Society. New Series 1 New Zealand Journal of Mathematics 1 International Journal of Bifurcation and Chaos in Applied Sciences and Engineering 1 Selecta Mathematica. New Series 1 Opuscula Mathematica 1 Discrete and Continuous Dynamical Systems 1 Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika 1 Natural Computing 1 Journal of Logic and Analysis 1 The Review of Symbolic Logic 1 Transactions of the London Mathematical Society 1 European Journal of Mathematics 1 Transactions of the American Mathematical Society. Series B 1 Bulletin of the Hellenic Mathematical Society all top 5 Cited in 28 Fields 595 Mathematical logic and foundations (03-XX) 122 Computer science (68-XX) 56 Combinatorics (05-XX) 24 Order, lattices, ordered algebraic structures (06-XX) 18 Number theory (11-XX) 12 General and overarching topics; collections (00-XX) 10 Group theory and generalizations (20-XX) 10 Dynamical systems and ergodic theory (37-XX) 7 Probability theory and stochastic processes (60-XX) 6 Field theory and polynomials (12-XX) 6 General topology (54-XX) 5 Measure and integration (28-XX) 2 History and biography (01-XX) 2 Commutative algebra (13-XX) 2 Geometry (51-XX) 2 Statistical mechanics, structure of matter (82-XX) 1 General algebraic systems (08-XX) 1 Algebraic geometry (14-XX) 1 Associative rings and algebras (16-XX) 1 Real functions (26-XX) 1 Potential theory (31-XX) 1 Partial differential equations (35-XX) 1 Harmonic analysis on Euclidean spaces (42-XX) 1 Functional analysis (46-XX) 1 Manifolds and cell complexes (57-XX) 1 Statistics (62-XX) 1 Quantum theory (81-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX) Citations by Year Wikidata Timeline The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.