×

Slaman, Theodore A.

Author ID: slaman.theodore-a Recent zbMATH articles by "Slaman, Theodore A."
Published as: Slaman, Theodore A.; Slaman, Theodore; Slaman, T. A.; Slaman, T.
Homepage: https://math.berkeley.edu/~slaman/
External Links: MGP · Wikidata · IdRef
all top 5

Co-Authors

19 single-authored
12 Shore, Richard Arnold
12 Woodin, W. Hugh
11 Chong, Chi Tat
10 Lempp, Steffen
9 Becher, Verónica
9 Yang, Yue
6 Feng, Qi
6 Groszek, Marcia J.
5 Maass, Wolfgang
4 Cholak, Peter A.
4 Greenberg, Noam
4 Jockusch, Carl G. jun.
4 Montalbán, Antonio
4 Mytilinaios, Michael E.
4 Reimann, Jan
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 Nies, André Otfrid
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
2 Scheerer, Adrian-Maria
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 Marker, David E.
1 Marks, Andrew S.
1 Pleszkovich, Mark
1 Qian, Lei
1 Rossegger, Dino
1 Seetapun, David
1 Semukhin, Pavel
1 Solovay, Robert M.
1 Steifer, Tomasz
1 Stephan, Frank
1 Todorcevic, Stevo B.
1 Tugué, Tosiyuki
1 Wainer, Stanley Scott
1 Yokoyama, Keita

Publications by Year

Citations contained in zbMATH Open

103 Publications have been cited 1,195 times in 740 Documents Cited by Year
On the strength of Ramsey’s theorem for pairs. Zbl 0977.03033
Cholak, Peter A.; Jockusch, Carl G.; Slaman, Theodore A.
114
2001
Generic copies of countable structures. Zbl 0678.03012
Ash, Chris; Knight, Julia; Manasse, Mark; Slaman, Theodore
72
1989
On the strength of Ramsey’s theorem. Zbl 0843.03034
Seetapun, David; Slaman, Theodore A.
66
1995
Randomness and recursive enumerability. Zbl 0992.68079
Kucera, Antonín; Slaman, T.
51
2001
Slicing the truth. On the computable and reverse mathematics of combinatorial principles. Zbl 1304.03001
Hirschfeldt, Denis R.
50
2014
The metamathematics of stable Ramsey’s theorem for pairs. Zbl 1341.03015
Chong, C. T.; Slaman, Theodore A.; Yang, Yue
40
2014
Interpretability and definability in the recursively enumerable degrees. Zbl 0904.03028
Nies, André; Shore, Richard A.; Slaman, Theodore A.
39
1998
Relative to any nonrecursive set. Zbl 0894.03017
Slaman, Theodore A.
37
1998
The atomic model theorem and type omitting. Zbl 1184.03005
Hirschfeldt, Denis R.; Shore, Richard A.; Slaman, Theodore A.
33
2009
Definable functions on degrees. Zbl 0677.03038
Slaman, Theodore A.; Steel, John R.
32
1988
Defining the Turing jump. Zbl 0958.03029
Shore, Richard A.; Slaman, Theodore A.
31
1999
Comparing DNR and WWKL. Zbl 1076.03039
Ambos-Spies, Klaus; Kjos-Hanssen, Bjørn; Lempp, Steffen; Slaman, Theodore A.
28
2004
\(\Sigma_n\)-bounding and \(\Delta_n\)-induction. Zbl 1053.03034
Slaman, Theodore A.
26
2004
Definability in the Turing degrees. Zbl 0592.03030
Slaman, Theodore A.; Woodin, W. Hugh
25
1986
Definability in the enumeration degrees. Zbl 0906.03043
Slaman, Theodore A.; Woodin, W. Hugh
24
1997
Measures and their random reals. Zbl 1375.03050
Reimann, Jan; Slaman, Theodore A.
24
2015
Extremes in the degrees of inferability. Zbl 0813.03026
Fortnow, Lance; Gasarch, William; Jain, Sanjay; Kinber, Efim; Kummer, Martin; Kurtz, Stuart; Pleszkovich, Mark; Slaman, Theodore; Solovay, Robert; Stephan, Frank
22
1994
\(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey’s theorem for pairs. Zbl 1255.03025
Chong, C. T.; Slaman, Theodore A.; Yang, Yue
18
2012
The strength of some combinatorial principles related to Ramsey’s theorem for pairs. Zbl 1167.03009
Hirschfeldt, Denis R.; Jockusch, Carl G. jun.; Kjos-Hanssen, Bjørn; Lempp, Steffen; Slaman, Theodore A.
17
2008
The density of infima in the recursively enumerable degrees. Zbl 0732.03034
Slaman, Theodore A.
17
1991
Working below a \(low_ 2\) recursively enumerable degree. Zbl 0693.03027
Shore, Richard A.; Slaman, Theodore A.
16
1990
The \(\Pi_{3}\)-theory of the computably enumerable Turing degrees is undecidable. Zbl 0904.03029
Lempp, Steffen; Nies, André; Slaman, Theodore A.
16
1998
A polynomial-time algorithm for computing absolutely normal numbers. Zbl 1315.03075
Becher, Verónica; Heiber, Pablo Ariel; Slaman, Theodore A.
16
2013
The inductive strength of Ramsey’s theorem for pairs. Zbl 1423.03047
Chong, C. T.; Slaman, Theodore A.; Yang, Yue
16
2017
Completely mitotic r. e. degrees. Zbl 0628.03028
Downey, R. G.; Slaman, T. A.
14
1989
Corrigendum to: “On the strength of Ramsey’s theorem for pairs”. Zbl 1182.03107
Cholak, Peter A.; Jockusch, Carl G. jun.; Slaman, Theodore A.
14
2009
Relative to any non-hyperarithmetic set. Zbl 1308.03050
Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A.
14
2013
Complementation in the Turing degrees. Zbl 0691.03024
Slaman, Theodore A.; Steel, John R.
13
1989
Extension of embeddings in the computably enumerable degrees. Zbl 0988.03063
Slaman, Theodore A.; Soare, Robert I.
12
2001
Every set has a least jump enumeration. Zbl 1023.03036
Coles, Richard J.; Downey, Rod G.; Slaman, Theodore A.
12
2000
Relative enumerability in the difference hierarchy. Zbl 0911.03021
Arslanov, Marat M.; LaForte, Geoffrey L.; Slaman, Theodore A.
12
1998
Notes on forcing axioms. Zbl 1294.03007
Todorcevic, Stevo
12
2014
Working below a high recursively enumerable degree. Zbl 0797.03043
Shore, Richard A.; Slaman, Theodore A.
11
1993
On the normality of numbers to different bases. Zbl 1372.11078
Becher, Verónica; Slaman, Theodore A.
11
2014
Martin’s conjecture, arithmetic equivalence, and countable Borel equivalence relations. Zbl 1431.03061
Marks, Andrew; Slaman, Theodore A.; Steel, John R.
10
2016
On the theory of the PTIME degrees of the recursive sets. Zbl 0715.68040
Shinoda, Juichi; Slaman, Theodore A.
10
1990
\(\Sigma_ 2\)-collection and the infinite injury priority method. Zbl 0645.03039
Mytilinaios, Michael E.; Slaman, Theodore A.
10
1988
Generics for computable Mathias forcing. Zbl 1320.03072
Cholak, Peter A.; Dzhafarov, Damir D.; Hirst, Jeffry L.; Slaman, Theodore A.
10
2014
\(\Pi^0_1\)-presentations of algebras. Zbl 1099.03025
Khoussainov, Bakhadyr; Slaman, Theodore; Semukhin, Pavel
10
2006
The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory. Zbl 0774.03028
Shore, Richard A.; Slaman, Theodore A.
9
1992
An almost deep degree. Zbl 0992.03049
Cholak, Peter; Groszek, Marcia; Slaman, Theodore
9
2001
Random reals, the rainbow Ramsey theorem, and arithmetic conservation. Zbl 1305.03055
Conidis, Chris J.; Slaman, Theodore A.
9
2013
Normal numbers and the Borel hierarchy. Zbl 1316.03024
Becher, Verónica; Heiber, Pablo Ariel; Slaman, Theodore A.
8
2014
The irrationality exponents of computable numbers. Zbl 1336.11053
Becher, Verónica; Bugeaud, Yann; Slaman, Theodore A.
8
2016
Independence results on the global structure of the Turing degrees. Zbl 0528.03027
Groszek, Marcia J.; Slaman, Theodore A.
7
1983
Global properties of the Turing degrees and the Turing jump. Zbl 1160.03023
Slaman, Theodore A.
7
2008
On zeros of Martin-Löf random Brownian motion. Zbl 1346.03044
Bienvenu, Laurent; Allen, Kelty; Slaman, Theodore A.
7
2014
The complexity of the index sets of \(\aleph_0\)-categorical theories and of Ehrenfeucht theories. Zbl 1123.03035
Lempp, Steffen; Slaman, Theodore A.
6
2007
Turing incomparability in Scott sets. Zbl 1123.03039
Kucera, Antonín; Slaman, Theodore A.
6
2007
On extensions of embeddings into the enumeration degrees of the \({\Sigma_2^0}\)-sets. Zbl 1097.03036
Lempp, Steffen; Slaman, Theodore A.; Sorbi, Andrea
6
2005
A limit on relative genericity in the recursively enumerable sets. Zbl 0699.03023
Lempp, Steffen; Slaman, Theodore A.
6
1989
Algebraic aspects of the computably enumerable degrees. Zbl 0812.03021
Slaman, Theodore A.; Soare, Robert I.
6
1995
Some results on effective randomness. Zbl 1100.03034
Merkle, Wolfgang; Mihailovic, Nenad; Slaman, Theodore A.
6
2006
On the \({\Sigma}_ 2\)-theory of the upper semilattice of Turing degrees. Zbl 0848.03021
Jockusch, Carl G. jun.; Slaman, Theodore A.
6
1993
Definability in the recursively enumerable degrees. Zbl 0874.03052
Nies, André; Shore, Richard A.; Slaman, Theodore A.
6
1996
A basis theorem for perfect sets. Zbl 0937.03058
Groszek, Marcia J.; Slaman, Theodore A.
6
1998
The Sacks density theorem and \(\Sigma_ 2\)-bounding. Zbl 0858.03047
Groszek, Marcia J.; Mytilinaios, Michael E.; Slaman, Theodore A.
6
1996
The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures. Zbl 1253.03068
Cai, Mingzhong; Shore, Richard A.; Slaman, Theodore A.
6
2012
A computable absolutely normal Liouville number. Zbl 1323.11058
Becher, Verónica; Heiber, Pablo Ariel; Slaman, Theodore A.
6
2015
Jump embeddings in the Turing degrees. Zbl 0745.03036
Hinman, Peter G.; Slaman, Theodore A.
5
1991
Degree structures. Zbl 0753.03018
Slaman, Theodore A.
5
1991
The \(\Pi_ 2^ 0\) enumeration degrees are not dense. Zbl 0874.03054
Calhoun, William C.; Slaman, Theodore A.
5
1996
A splitting theorem for \(n\)-REA degrees. Zbl 0993.03054
Shore, Richard A.; Slaman, Theodore A.
5
2001
Low upper bounds of ideals. Zbl 1168.68021
Kučera, Antonín; Slaman, Theodore A.
5
2009
\(K\)-trivials are never continuously random. Zbl 1296.03022
Barmpalias, George; Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A.
5
2012
The Slaman-Wehner theorem in higher recursion theory. Zbl 1237.03020
Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A.
4
2011
Computability, enumerability, unsolvability. Directions in recursion theory. Zbl 0830.00006
4
1996
\(\Sigma\) \({}_ 1\)-collection and the finite injury priority method. Zbl 0702.03035
Slaman, Theodore A.; Woodin, W. Hugh
4
1989
Computably enumerable algebras, their expansions, and isomorphisms. Zbl 1096.03050
Khoussainov, Bakhadyr; Lempp, Steffen; Slaman, Theodore A.
4
2005
\(E\)-recursion, forcing and \(C^*\)-algebras. Zbl 1295.03004
4
2014
Effective randomness for continuous measures. Zbl 07485050
Reimann, Jan; Slaman, Theodore A.
4
2022
The strength of Ramsey’s theorem for pairs and arbitrarily many colors. Zbl 1436.03098
Slaman, Theodore A.; Yokoyama, Keita
3
2018
\(\Sigma\)\( _ 1\) definitions with parameters. Zbl 0629.03022
Slaman, T. A.
3
1986
The E-recursively enumerable degrees are dense. Zbl 0574.03033
Slaman, Theodore A.
3
1985
Reflection and forcing in E-recursion theory. Zbl 0574.03034
Slaman, Theodore A.
3
1985
\(\Pi_1^0\) classes and minimal degrees. Zbl 0952.03051
Groszek, Marcia J.; Slaman, Theodore A.
3
1997
Extending partial orders to dense linear orders. Zbl 0924.03094
Slaman, Theodore A.; Woodin, W. Hugh
3
1998
Aspects of the Turing jump. Zbl 1086.03032
Slaman, Theodore A.
3
2005
Inadmissible forcing. Zbl 0645.03046
Sacks, G. E.; Slaman, T. A.
3
1987
On the construction of absolutely normal numbers. Zbl 1429.11133
Aistleitner, Christoph; Becher, Verónica; Scheerer, Adrian-Maria; Slaman, Theodore A.
3
2017
On simply normal numbers to different bases. Zbl 1343.11065
Becher, Verónica; Bugeaud, Yann; Slaman, Theodore A.
3
2016
On the existence of a strong minimal pair. Zbl 1386.03044
Barmpalias, George; Cai, Mingzhong; Lempp, Steffen; Slaman, Theodore A.
3
2015
Recursive in a generic real. Zbl 0960.03040
Shinoda, Juichi; Slaman, Theodore A.
2
2000
\(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield’s conjecture. Zbl 0976.03049
Chong, C. T.; Qian, Lei; Slaman, Theodore A.; Yang, Yue
2
2001
Automorphisms in the PTIME-Turing degrees of recursive sets. Zbl 0865.03034
Haught, Christine Ann; Slaman, Theodore A.
2
1997
Relatively recursive expansions. II. Zbl 0809.03024
Ash, C. J.; Knight, J. F.; Slaman, T. A.
2
1993
The enumeration degrees: local and global structural interactions. Zbl 1420.03097
Slaman, Theodore A.; Soskova, Mariya I.
2
2017
The \(\Delta ^0_2\) Turing degrees: automorphisms and definability. Zbl 1445.03047
Slaman, Theodore A.; Soskova, Mariya I.
2
2018
A note on initial segments of the enumeration degrees. Zbl 1337.03060
Slaman, Theodore A.; Sorbi, Andrea
2
2014
Infinity and truth. Based on talks given at the workshop, Singapore, July 25–29, 2011. Zbl 1283.03007
2
2014
Fragments of the theory of the enumeration degrees. Zbl 1535.03216
Lempp, Steffen; Slaman, Theodore A.; Soskova, Mariya I.
1
2021
The extended plus-one hypothesis - a relative consistency result. Zbl 0549.03033
Slaman, Theodore A.
1
1983
Conference on computability theory. Proceedings of the conference, Oberwolfach, Germany, January 27–February 3, 1996. Zbl 0922.00014
1
1998
Differences between resource bounded degree structures. Zbl 1068.03034
Mytilinaios, Michael E.; Slaman, Theodore A.
1
2003
Mathematical definability. Zbl 0932.03054
Slaman, Theodore A.
1
1998
Extensional properties of sets of time bounded complexity. Zbl 0756.68043
Maass, Wolfgang; Slaman, Theodore A.
1
1989
On co-simple isols and their intersection types. Zbl 0773.03031
Downey, Rod; Slaman, Theodore A.
1
1992
On a question of Brown and Simpson. Zbl 0835.03026
Mytilinaios, Michael E.; Slaman, Theodore A.
1
1996
The theory of the metarecursively enumerable degrees. Zbl 1109.03040
Greenberg, Noam; Shore, Richard A.; Slaman, Theodore A.
1
2006
The \(\forall\exists\) theory of \({\mathcal D}(\leq,\vee,{}')\) is undecidable. Zbl 1108.03047
Shore, Richard A.; Slaman, Theodore A.
1
2006
Effective randomness for continuous measures. Zbl 07485050
Reimann, Jan; Slaman, Theodore A.
4
2022
Fragments of the theory of the enumeration degrees. Zbl 1535.03216
Lempp, Steffen; Slaman, Theodore A.; Soskova, Mariya I.
1
2021
On capacitability for co-analytic sets. Zbl 07566106
Slaman, Theodore A.
1
2021
The strength of Ramsey’s theorem for pairs and arbitrarily many colors. Zbl 1436.03098
Slaman, Theodore A.; Yokoyama, Keita
3
2018
The \(\Delta ^0_2\) Turing degrees: automorphisms and definability. Zbl 1445.03047
Slaman, Theodore A.; Soskova, Mariya I.
2
2018
Irrationality exponent, Hausdorff dimension and effectivization. Zbl 1448.11142
Becher, Verónica; Reimann, Jan; Slaman, Theodore A.
1
2018
The inductive strength of Ramsey’s theorem for pairs. Zbl 1423.03047
Chong, C. T.; Slaman, Theodore A.; Yang, Yue
16
2017
On the construction of absolutely normal numbers. Zbl 1429.11133
Aistleitner, Christoph; Becher, Verónica; Scheerer, Adrian-Maria; Slaman, Theodore A.
3
2017
The enumeration degrees: local and global structural interactions. Zbl 1420.03097
Slaman, Theodore A.; Soskova, Mariya I.
2
2017
Martin’s conjecture, arithmetic equivalence, and countable Borel equivalence relations. Zbl 1431.03061
Marks, Andrew; Slaman, Theodore A.; Steel, John R.
10
2016
The irrationality exponents of computable numbers. Zbl 1336.11053
Becher, Verónica; Bugeaud, Yann; Slaman, Theodore A.
8
2016
On simply normal numbers to different bases. Zbl 1343.11065
Becher, Verónica; Bugeaud, Yann; Slaman, Theodore A.
3
2016
Forcing, iterated ultrapowers, and Turing degrees. Lecture notes from the 2010 and 2011 Asian Initiative for Infinity (AII) Logic Summer School, National University of Singapore, Singapore. Zbl 1327.03003
1
2016
Measures and their random reals. Zbl 1375.03050
Reimann, Jan; Slaman, Theodore A.
24
2015
A computable absolutely normal Liouville number. Zbl 1323.11058
Becher, Verónica; Heiber, Pablo Ariel; Slaman, Theodore A.
6
2015
On the existence of a strong minimal pair. Zbl 1386.03044
Barmpalias, George; Cai, Mingzhong; Lempp, Steffen; Slaman, Theodore A.
3
2015
Slicing the truth. On the computable and reverse mathematics of combinatorial principles. Zbl 1304.03001
Hirschfeldt, Denis R.
50
2014
The metamathematics of stable Ramsey’s theorem for pairs. Zbl 1341.03015
Chong, C. T.; Slaman, Theodore A.; Yang, Yue
40
2014
Notes on forcing axioms. Zbl 1294.03007
Todorcevic, Stevo
12
2014
On the normality of numbers to different bases. Zbl 1372.11078
Becher, Verónica; Slaman, Theodore A.
11
2014
Generics for computable Mathias forcing. Zbl 1320.03072
Cholak, Peter A.; Dzhafarov, Damir D.; Hirst, Jeffry L.; Slaman, Theodore A.
10
2014
Normal numbers and the Borel hierarchy. Zbl 1316.03024
Becher, Verónica; Heiber, Pablo Ariel; Slaman, Theodore A.
8
2014
On zeros of Martin-Löf random Brownian motion. Zbl 1346.03044
Bienvenu, Laurent; Allen, Kelty; Slaman, Theodore A.
7
2014
\(E\)-recursion, forcing and \(C^*\)-algebras. Zbl 1295.03004
4
2014
A note on initial segments of the enumeration degrees. Zbl 1337.03060
Slaman, Theodore A.; Sorbi, Andrea
2
2014
Infinity and truth. Based on talks given at the workshop, Singapore, July 25–29, 2011. Zbl 1283.03007
2
2014
A polynomial-time algorithm for computing absolutely normal numbers. Zbl 1315.03075
Becher, Verónica; Heiber, Pablo Ariel; Slaman, Theodore A.
16
2013
Relative to any non-hyperarithmetic set. Zbl 1308.03050
Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A.
14
2013
Random reals, the rainbow Ramsey theorem, and arithmetic conservation. Zbl 1305.03055
Conidis, Chris J.; Slaman, Theodore A.
9
2013
\(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey’s theorem for pairs. Zbl 1255.03025
Chong, C. T.; Slaman, Theodore A.; Yang, Yue
18
2012
The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures. Zbl 1253.03068
Cai, Mingzhong; Shore, Richard A.; Slaman, Theodore A.
6
2012
\(K\)-trivials are never continuously random. Zbl 1296.03022
Barmpalias, George; Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A.
5
2012
The Slaman-Wehner theorem in higher recursion theory. Zbl 1237.03020
Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A.
4
2011
The atomic model theorem and type omitting. Zbl 1184.03005
Hirschfeldt, Denis R.; Shore, Richard A.; Slaman, Theodore A.
33
2009
Corrigendum to: “On the strength of Ramsey’s theorem for pairs”. Zbl 1182.03107
Cholak, Peter A.; Jockusch, Carl G. jun.; Slaman, Theodore A.
14
2009
Low upper bounds of ideals. Zbl 1168.68021
Kučera, Antonín; Slaman, Theodore A.
5
2009
The strength of some combinatorial principles related to Ramsey’s theorem for pairs. Zbl 1167.03009
Hirschfeldt, Denis R.; Jockusch, Carl G. jun.; Kjos-Hanssen, Bjørn; Lempp, Steffen; Slaman, Theodore A.
17
2008
Global properties of the Turing degrees and the Turing jump. Zbl 1160.03023
Slaman, Theodore A.
7
2008
The complexity of the index sets of \(\aleph_0\)-categorical theories and of Ehrenfeucht theories. Zbl 1123.03035
Lempp, Steffen; Slaman, Theodore A.
6
2007
Turing incomparability in Scott sets. Zbl 1123.03039
Kucera, Antonín; Slaman, Theodore A.
6
2007
\(\Pi^0_1\)-presentations of algebras. Zbl 1099.03025
Khoussainov, Bakhadyr; Slaman, Theodore; Semukhin, Pavel
10
2006
Some results on effective randomness. Zbl 1100.03034
Merkle, Wolfgang; Mihailovic, Nenad; Slaman, Theodore A.
6
2006
The theory of the metarecursively enumerable degrees. Zbl 1109.03040
Greenberg, Noam; Shore, Richard A.; Slaman, Theodore A.
1
2006
The \(\forall\exists\) theory of \({\mathcal D}(\leq,\vee,{}')\) is undecidable. Zbl 1108.03047
Shore, Richard A.; Slaman, Theodore A.
1
2006
On extensions of embeddings into the enumeration degrees of the \({\Sigma_2^0}\)-sets. Zbl 1097.03036
Lempp, Steffen; Slaman, Theodore A.; Sorbi, Andrea
6
2005
Computably enumerable algebras, their expansions, and isomorphisms. Zbl 1096.03050
Khoussainov, Bakhadyr; Lempp, Steffen; Slaman, Theodore A.
4
2005
Aspects of the Turing jump. Zbl 1086.03032
Slaman, Theodore A.
3
2005
Comparing DNR and WWKL. Zbl 1076.03039
Ambos-Spies, Klaus; Kjos-Hanssen, Bjørn; Lempp, Steffen; Slaman, Theodore A.
28
2004
\(\Sigma_n\)-bounding and \(\Delta_n\)-induction. Zbl 1053.03034
Slaman, Theodore A.
26
2004
Differences between resource bounded degree structures. Zbl 1068.03034
Mytilinaios, Michael E.; Slaman, Theodore A.
1
2003
On the strength of Ramsey’s theorem for pairs. Zbl 0977.03033
Cholak, Peter A.; Jockusch, Carl G.; Slaman, Theodore A.
114
2001
Randomness and recursive enumerability. Zbl 0992.68079
Kucera, Antonín; Slaman, T.
51
2001
Extension of embeddings in the computably enumerable degrees. Zbl 0988.03063
Slaman, Theodore A.; Soare, Robert I.
12
2001
An almost deep degree. Zbl 0992.03049
Cholak, Peter; Groszek, Marcia; Slaman, Theodore
9
2001
A splitting theorem for \(n\)-REA degrees. Zbl 0993.03054
Shore, 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.03049
Chong, C. T.; Qian, Lei; Slaman, Theodore A.; Yang, Yue
2
2001
Every set has a least jump enumeration. Zbl 1023.03036
Coles, Richard J.; Downey, Rod G.; Slaman, Theodore A.
12
2000
Recursive in a generic real. Zbl 0960.03040
Shinoda, Juichi; Slaman, Theodore A.
2
2000
Defining the Turing jump. Zbl 0958.03029
Shore, Richard A.; Slaman, Theodore A.
31
1999
Interpretability and definability in the recursively enumerable degrees. Zbl 0904.03028
Nies, André; Shore, Richard A.; Slaman, Theodore A.
39
1998
Relative to any nonrecursive set. Zbl 0894.03017
Slaman, Theodore A.
37
1998
The \(\Pi_{3}\)-theory of the computably enumerable Turing degrees is undecidable. Zbl 0904.03029
Lempp, Steffen; Nies, André; Slaman, Theodore A.
16
1998
Relative enumerability in the difference hierarchy. Zbl 0911.03021
Arslanov, Marat M.; LaForte, Geoffrey L.; Slaman, Theodore A.
12
1998
A basis theorem for perfect sets. Zbl 0937.03058
Groszek, Marcia J.; Slaman, Theodore A.
6
1998
Extending partial orders to dense linear orders. Zbl 0924.03094
Slaman, Theodore A.; Woodin, W. Hugh
3
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.03054
Slaman, Theodore A.
1
1998
Definability in the enumeration degrees. Zbl 0906.03043
Slaman, Theodore A.; Woodin, W. Hugh
24
1997
\(\Pi_1^0\) classes and minimal degrees. Zbl 0952.03051
Groszek, Marcia J.; Slaman, Theodore A.
3
1997
Automorphisms in the PTIME-Turing degrees of recursive sets. Zbl 0865.03034
Haught, Christine Ann; Slaman, Theodore A.
2
1997
Definability in the recursively enumerable degrees. Zbl 0874.03052
Nies, André; Shore, Richard A.; Slaman, Theodore A.
6
1996
The Sacks density theorem and \(\Sigma_ 2\)-bounding. Zbl 0858.03047
Groszek, Marcia J.; Mytilinaios, Michael E.; Slaman, Theodore A.
6
1996
The \(\Pi_ 2^ 0\) enumeration degrees are not dense. Zbl 0874.03054
Calhoun, William C.; Slaman, Theodore A.
5
1996
Computability, enumerability, unsolvability. Directions in recursion theory. Zbl 0830.00006
4
1996
On a question of Brown and Simpson. Zbl 0835.03026
Mytilinaios, Michael E.; Slaman, Theodore A.
1
1996
On the strength of Ramsey’s theorem. Zbl 0843.03034
Seetapun, David; Slaman, Theodore A.
66
1995
Algebraic aspects of the computably enumerable degrees. Zbl 0812.03021
Slaman, Theodore A.; Soare, Robert I.
6
1995
Extremes in the degrees of inferability. Zbl 0813.03026
Fortnow, Lance; Gasarch, William; Jain, Sanjay; Kinber, Efim; Kummer, Martin; Kurtz, Stuart; Pleszkovich, Mark; Slaman, Theodore; Solovay, Robert; Stephan, Frank
22
1994
Working below a high recursively enumerable degree. Zbl 0797.03043
Shore, Richard A.; Slaman, Theodore A.
11
1993
On the \({\Sigma}_ 2\)-theory of the upper semilattice of Turing degrees. Zbl 0848.03021
Jockusch, Carl G. jun.; Slaman, Theodore A.
6
1993
Relatively recursive expansions. II. Zbl 0809.03024
Ash, 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.03028
Shore, Richard A.; Slaman, Theodore A.
9
1992
On co-simple isols and their intersection types. Zbl 0773.03031
Downey, Rod; Slaman, Theodore A.
1
1992
The density of infima in the recursively enumerable degrees. Zbl 0732.03034
Slaman, Theodore A.
17
1991
Jump embeddings in the Turing degrees. Zbl 0745.03036
Hinman, Peter G.; Slaman, Theodore A.
5
1991
Degree structures. Zbl 0753.03018
Slaman, Theodore A.
5
1991
Working below a \(low_ 2\) recursively enumerable degree. Zbl 0693.03027
Shore, Richard A.; Slaman, Theodore A.
16
1990
On the theory of the PTIME degrees of the recursive sets. Zbl 0715.68040
Shinoda, Juichi; Slaman, Theodore A.
10
1990
Generic copies of countable structures. Zbl 0678.03012
Ash, Chris; Knight, Julia; Manasse, Mark; Slaman, Theodore
72
1989
Completely mitotic r. e. degrees. Zbl 0628.03028
Downey, R. G.; Slaman, T. A.
14
1989
Complementation in the Turing degrees. Zbl 0691.03024
Slaman, Theodore A.; Steel, John R.
13
1989
A limit on relative genericity in the recursively enumerable sets. Zbl 0699.03023
Lempp, Steffen; Slaman, Theodore A.
6
1989
\(\Sigma\) \({}_ 1\)-collection and the finite injury priority method. Zbl 0702.03035
Slaman, Theodore A.; Woodin, W. Hugh
4
1989
Extensional properties of sets of time bounded complexity. Zbl 0756.68043
Maass, Wolfgang; Slaman, Theodore A.
1
1989
Definable functions on degrees. Zbl 0677.03038
Slaman, Theodore A.; Steel, John R.
32
1988
\(\Sigma_ 2\)-collection and the infinite injury priority method. Zbl 0645.03039
Mytilinaios, Michael E.; Slaman, Theodore A.
10
1988
Inadmissible forcing. Zbl 0645.03046
Sacks, G. E.; Slaman, T. A.
3
1987
Definability in the Turing degrees. Zbl 0592.03030
Slaman, Theodore A.; Woodin, W. Hugh
25
1986
\(\Sigma\)\( _ 1\) definitions with parameters. Zbl 0629.03022
Slaman, T. A.
3
1986
The E-recursively enumerable degrees are dense. Zbl 0574.03033
Slaman, Theodore A.
3
1985
...and 3 more Documents
all top 5

Cited by 446 Authors

47 Downey, Rodney Graham
42 Slaman, Theodore A.
39 Shore, Richard Arnold
31 Stephan, Frank
27 Nies, André Otfrid
26 Patey, Ludovic
23 Montalbán, Antonio
22 Miller, Joseph S.
21 Greenberg, Noam
21 Lempp, Steffen
18 Hirschfeldt, Denis Roman
18 Soskova, Mariya Ivanova
17 Chong, Chi Tat
17 Dzhafarov, Damir D.
17 Kalimullin, Iskander Shagitovich
16 Barmpalias, George
16 Solomon, Reed
15 Yang, Yue
14 Bazhenov, Nikolaĭ Alekseevich
14 Lewis-Pye, Andrew E. M.
14 Miller, Russell G.
13 Cholak, Peter A.
13 Harrison-Trainor, Matthew
13 Knight, Julia F.
13 Melnikov, Alexander G.
12 Calude, Cristian S.
12 Kjos-Hanssen, Bjørn
12 Yokoyama, Keita
11 Ganchev, Hristo A.
11 Jockusch, Carl G. jun.
11 Simpson, Stephen G.
11 Sorbi, Andrea
11 Wu, Guohua
10 Bienvenu, Laurent
10 Cai, Mingzhong
10 Harizanov, Valentina S.
10 Jain, Sanjay
10 Yu, Liang
9 Cooper, Stuart Barry
9 Li, Angsheng
9 Ng, KengMeng
9 Shafer, Paul
9 Wang, Wei
8 Andrews, Uri
8 Arslanov, Marat M.
8 Becher, Verónica
8 Kasymov, Nadimulla Khabibullaevich
8 Khoussainov, Bakhadyr M.
8 Kihara, Takayuki
8 Kreuzer, Alexander P.
8 Monin, Benoît
8 Yamaleev, Mars Mansurovich
7 Hirst, Jeffry Lynn
7 Lerman, Manuel
6 Csima, Barbara F.
6 Fokina, Ekaterina B.
6 Hölzl, Rupert
6 Kołodziejczyk, Leszek Aleksander
6 Liu, Lu
6 Turetsky, Dan
6 Westrick, Linda Brown
5 Airey, Dylan
5 Ambos-Spies, Klaus
5 Cenzer, Douglas
5 Dadazhanov, Ruzmat Normatovich
5 Day, Adam R.
5 Dorais, François Gilbert
5 Fiori-Carones, Marta
5 Goncharov, Sergeĭ Savost’yanovich
5 Li, Wei
5 Mance, Bill
5 Marcone, Alberto
5 Merkle, Wolfgang
5 Mileti, Joseph R.
5 Porter, Christopher P.
5 Tadaki, Kohtaro
4 Binns, Stephen
4 Carlucci, Lorenzo
4 Conidis, Chris J.
4 Ding, Decheng
4 Faĭzrahmanov, Marat Khaidarovich
4 Figueira, Santiago
4 Griffiths, Evan J.
4 Groszek, Marcia J.
4 Kent, Thomas F.
4 Kinber, Efim B.
4 Morozov, Andreĭ Sergeevich
4 Rossegger, Dino
4 San Mauro, Luca
4 Sariev, Andrey C.
4 Shinoda, Juichi
4 Staiger, Ludwig
4 Terwijn, Sebastiaan A.
4 Wong, Tin Lok
3 Ash, Christopher John
3 Bélanger, David R.
3 Beros, Achilles A.
3 Brattka, Vasco
3 Buss, Samuel R.
3 Flood, Stephen P.
...and 346 more Authors
all top 5

Cited in 76 Serials

104 The Journal of Symbolic Logic
98 Annals of Pure and Applied Logic
47 Archive for Mathematical Logic
42 The Bulletin of Symbolic Logic
35 Transactions of the American Mathematical Society
27 Journal of Mathematical Logic
26 Proceedings of the American Mathematical Society
24 Theoretical Computer Science
24 Mathematical Logic Quarterly (MLQ)
20 Notre Dame Journal of Formal Logic
19 Israel Journal of Mathematics
18 Algebra and Logic
17 Advances in Mathematics
16 Journal of Computer and System Sciences
14 Information and Computation
10 Theory of Computing Systems
8 Journal of Mathematical Sciences (New York)
8 Computability
7 Lobachevskii Journal of Mathematics
6 Siberian Mathematical Journal
5 Memoirs of the American Mathematical Society
5 Godishnik na Sofiĭskiya Universitet “Sv. Kliment Okhridski”. Fakultet po Matematika i Informatika
5 Russian Mathematics
4 Fundamenta Mathematicae
3 Mathematics of Computation
3 Bulletin of the London Mathematical Society
3 Journal of Algebra
3 Journal of the American Mathematical Society
3 Mathematical Structures in Computer Science
3 Sibirskie Èlektronnye Matematicheskie Izvestiya
3 Proceedings of the Steklov Institute of Mathematics
2 Mathematische Annalen
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 Groups, Geometry, and Dynamics
2 Logical Methods in Computer Science
2 Forum of Mathematics, Sigma
2 European Journal of Mathematics
1 Information Processing Letters
1 Journal of Mathematical Analysis and Applications
1 Mathematical Notes
1 Mathematical Proceedings of the Cambridge Philosophical Society
1 Nonlinearity
1 Chaos, Solitons and Fractals
1 Theory of Probability and its Applications
1 Acta Arithmetica
1 Canadian Journal of Mathematics
1 Duke Mathematical Journal
1 Inventiones Mathematicae
1 Monatshefte für Mathematik
1 Nagoya Mathematical Journal
1 Synthese
1 Tôhoku Mathematical Journal. Second Series
1 Topology and its Applications
1 Physica D
1 Journal of Computer Science and Technology
1 Journal of Theoretical Probability
1 Science in China. Series A
1 Sugaku Expositions
1 International Journal of Algebra and Computation
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 Transactions of the American Mathematical Society. Series B
1 Bulletin of the Hellenic Mathematical Society

Citations by Year

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.