☰

Theodore A. Slaman - Publications

Affiliations: 
Mathematics University of California, Berkeley, Berkeley, CA, United States 
Area:
Recursion theory, mathematical logic
Website:
https://math.berkeley.edu/people/faculty/theodore-slaman
Tree Info Similar researchers PubMed Report error

71 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Dorais F, Evans Z, Groszek M, Harris S, Slaman T. Schmerl decompositions in first order arithmetic Annals of Pure and Applied Logic. 170: 102717. DOI: 10.1016/J.Apal.2019.102717  0.375
2017 Slaman TA, Soskova MI. The $\Delta ^0_2$ Turing degrees: Automorphisms and Definability Transactions of the American Mathematical Society. 370: 1351-1375. DOI: 10.1090/Tran/7187  0.343
2017 Chong C, Slaman TA, Yang Y. The inductive strength of Ramsey's Theorem for Pairs Advances in Mathematics. 308: 121-141. DOI: 10.1016/J.Aim.2016.11.036  0.392
2017 Becher V, Reimann J, Slaman TA. Irrationality exponent, Hausdorff dimension and effectivization Monatshefte FüR Mathematik. 185: 167-188. DOI: 10.1007/S00605-017-1094-2  0.414
2016 Becher V, Bugeaud Y, Slaman TA. On simply normal numbers to different bases Mathematische Annalen. 364: 125-150. DOI: 10.1007/S00208-015-1209-9  0.318
2015 Allen K, Bienvenu L, Slaman TA. On zeros of Martin-Löf random Brownian motion Journal of Logic and Analysis. 6: 1-34. DOI: 10.4115/Jla.2014.6.9  0.565
2015 Barmpalias G, Cai M, Lempp S, Slaman TA. On the existence of a strong minimal pair Journal of Mathematical Logic. 15. DOI: 10.1142/S0219061315500038  0.337
2014 Becher V, Heiber PA, Slaman TA. Normal numbers and the Borel hierarchy Fundamenta Mathematicae. 226: 63-77. DOI: 10.4064/Fm226-1-4  0.351
2014 Becher V, Slaman TA. On the normality of numbers to different bases Journal of the London Mathematical Society. 90: 472-494. DOI: 10.1112/Jlms/Jdu035  0.356
2014 Chong CT, Slaman TA, Yang Y. The metamathematics of stable Ramsey’s theorem for pairs Journal of the American Mathematical Society. 27: 863-892. DOI: 10.1090/S0894-0347-2014-00789-X  0.358
2014 Slaman TA, Sorbi A. A note on initial segments of the enumeration degrees Journal of Symbolic Logic. 79: 633-643. DOI: 10.1017/Jsl.2013.1  0.337
2014 Cholak PA, Dzhafarov DD, Hirst JL, Slaman TA. Generics for computable Mathias forcing Annals of Pure and Applied Logic. 165: 1418-1428. DOI: 10.1016/J.Apal.2014.04.011  0.325
2013 Conidis CJ, Slaman TA. Random reals, the rainbow ramsey theorem, and arithmetic conservation Journal of Symbolic Logic. 78: 195-206. DOI: 10.2178/Jsl.7801130  0.41
2013 Greenberg N, Montalbán A, Slaman TA. Relative to any non-hyperarithmetic set Journal of Mathematical Logic. 13. DOI: 10.1142/S0219061312500079  0.395
2013 Becher V, Heiber PA, Slaman TA. A polynomial-time algorithm for computing absolutely normal numbers Information and Computation. 232: 1-9. DOI: 10.1016/J.Ic.2013.08.013  0.303
2012 Cai M, Shore RA, Slaman TA. The n-r.e. degrees: Undecidability and Σ1 substructures Journal of Mathematical Logic. 12. DOI: 10.1142/S0219061312500055  0.301
2012 Chong CT, Slaman TA, Yang Y. Π11-conservation of combinatorial principles weaker than Ramsey's theorem for pairs Advances in Mathematics. 230: 1060-1077. DOI: 10.1016/J.Aim.2012.02.025  0.365
2010 Chong CT, Slaman TA. The theory of the α degrees is undecidable Israel Journal of Mathematics. 178: 229-252. DOI: 10.1007/S11856-010-0064-3  0.329
2009 Cholak PA, Jockusch CG, Slaman TA. Corrigendum to: "On the strength of ramsey's theorem for pairs" Journal of Symbolic Logic. 74: 1438-1439. DOI: 10.2178/Jsl/1254748700  0.385
2009 Hirschfeldt DR, Shore RA, Slaman TA. The atomic model theorem and type omitting Transactions of the American Mathematical Society. 361: 5805-5837. DOI: 10.1090/S0002-9947-09-04847-8  0.336
2006 GREENBERG N, SHORE RA, SLAMAN TA. THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES Journal of Mathematical Logic. 6: 49-68. DOI: 10.1142/S0219061306000505  0.411
2006 Merkle W, Mihailović N, Slaman TA. Some results on effective randomness Theory of Computing Systems. 39: 707-721. DOI: 10.1007/S00224-005-1212-8  0.341
2006 Khoussainov B, Slaman T, Semukhin P. π0 1-Presentations of algebras Archive For Mathematical Logic. 45: 769-781. DOI: 10.1007/S00153-006-0013-3  0.374
2005 LEMPP S, SLAMAN TA, SORBI A. ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS Journal of Mathematical Logic. 5: 247-298. DOI: 10.1142/S0219061305000432  0.365
2005 Khoussainov B, Lempp S, Slaman TA. Computably enumerable algebras, their expansions, and isomorphisms International Journal of Algebra and Computation. 15: 437-454. DOI: 10.1142/S0218196705002281  0.37
2004 Ambos-Spies K, Kjos-Hanssen B, Lempp S, Slaman TA. Comparing DNR and WWKL Journal of Symbolic Logic. 69: 1089-1104. DOI: 10.2178/Jsl/1102022212  0.649
2003 Mytilinaios ME, Slaman TA. Differences between Resource Bounded degree structures Notre Dame Journal of Formal Logic. 44: 1-12. DOI: 10.1305/Ndjfl/1082637612  0.37
2001 Slaman TA, Soare RI. Extension of embeddings in the computably enumerable degrees Annals of Mathematics. 154: 1-43. DOI: 10.2307/3062109  0.321
2001 Cholak P, Groszek M, Slaman T. An almost deep degree Journal of Symbolic Logic. 66: 881-901. DOI: 10.2307/2695051  0.336
2001 Cholak PA, Jokusch CG, Slaman TA. On the strength of Ramsey's theorem for pairs Journal of Symbolic Logic. 66: 1-55. DOI: 10.2307/2694910  0.382
2001 Kučera A, Slaman TA. Randomness and recursive enumerability Siam Journal On Computing. 31: 199-211. DOI: 10.1137/S0097539799357441  0.349
2001 Chong CT, Qian L, Slaman TA, Yang Y. ∑2 induction and infinite injury priority arguments, part III: Prompt sets, minimal pairs and shoenfield's conjecture Israel Journal of Mathematics. 121: 1-28. DOI: 10.1007/Bf02802493  0.382
2000 Shinoda J, Slaman TA. Recursive in a generic real Journal of Symbolic Logic. 65: 164-172. DOI: 10.2307/2586529  0.337
2000 Coles RJ, Downey RG, Slaman TA. Every set has a least jump enumeration Journal of the London Mathematical Society. 62: 641-649. DOI: 10.1112/S0024610700001459  0.409
1999 Shore RA, Slaman TA. Defining the Turing jump Mathematical Research Letters. 6: 711-722. DOI: 10.4310/Mrl.1999.V6.N6.A10  0.36
1999 Slaman TA. On a question of Sierpiński Fundamenta Mathematicae. 159: 153-159. DOI: 10.4064/Fm-159-2-153-159  0.313
1999 Slaman TA. Chapter 5 The global structure of the turing degrees Studies in Logic and the Foundations of Mathematics. 140: 155-168. DOI: 10.1016/S0049-237X(99)80021-4  0.349
1998 Groszek MJ, Slaman TA. A basis theorem for perfect sets Bulletin of Symbolic Logic. 4: 204-209. DOI: 10.2307/421023  0.366
1998 Arslanov MM, Laforte GL, Slaman TA. Relative enumerability in the difference hierarchy Journal of Symbolic Logic. 63: 411-420. DOI: 10.2307/2586839  0.328
1998 Nies A, Shore RA, Slaman TA. Interpretability and definability in the recursively enumerable degrees Proceedings of the London Mathematical Society. 77: 241-291. DOI: 10.1112/S002461159800046X  0.316
1998 Lempp S, Nies A, Slaman TA. The Π₃-theory of the computably enumerable Turing degrees is undecidable Transactions of the American Mathematical Society. 350: 2719-2736. DOI: 10.1090/S0002-9947-98-01800-5  0.439
1998 Slaman TA, Woodin WH. Extending partial orders to dense linear orders Annals of Pure and Applied Logic. 94: 253-261. DOI: 10.1016/S0168-0072(97)00075-4  0.346
1998 Slaman TA, Sorbi A. Quasi-minimal enumeration degrees and minimal turing degrees Annali Di Matematica Pura Ed Applicata. 174: 97-120. DOI: 10.1007/Bf01759368  0.365
1997 Haught CA, Slaman TA. Automorphisms in the PTIME-turing degrees of recursive sets Annals of Pure and Applied Logic. 84: 139-152. DOI: 10.1016/S0168-0072(95)00065-8  0.389
1997 Slaman TA, Woodin WH. Definability in the enumeration degrees Archive For Mathematical Logic. 36: 255-267. DOI: 10.1007/S001530050064  0.365
1996 Nies A, Shore RA, Slaman TA. Definability in the recursively enumerable degrees Bulletin of Symbolic Logic. 2: 392-404. DOI: 10.2307/421171  0.405
1996 Calhoun WC, Slaman TA. The Π0 2 enumeration degrees are not dense Journal of Symbolic Logic. 61: 1364-1379. DOI: 10.2307/2275821  0.321
1996 Groszek MJ, Mytilinaios ME, Slaman TA. The sacks density theorem and Σ2-bounding Journal of Symbolic Logic. 61: 450-467. DOI: 10.2307/2275670  0.355
1995 Slaman TA, Soare RI. Algebraic aspects of the computably enumerable degrees. Proceedings of the National Academy of Sciences of the United States of America. 92: 617-21. PMID 11607508 DOI: 10.1073/Pnas.92.2.617  0.403
1995 Seetapun D, Slaman TA. On the strength of Ramsey’s theorem Notre Dame Journal of Formal Logic. 36: 570-582. DOI: 10.1305/Ndjfl/1040136917  0.37
1994 Fortnow L, Gasarch W, Jain S, Kinber E, Kummer M, Kurtz S, Pleszkovich M, Slaman T, Solovay R, Stephan F. Extremes in the degrees of inferability Annals of Pure and Applied Logic. 66: 231-276. DOI: 10.1016/0168-0072(94)90035-3  0.347
1993 Jockusch CG, Slaman TA. On the Σ2-theory of the upper semilattice of Turing degrees Journal of Symbolic Logic. 58: 193-204. DOI: 10.2307/2275332  0.4
1993 Shore RA, Slaman TA. Working below a high recursively enumerable degree Journal of Symbolic Logic. 58: 824-859. DOI: 10.2307/2275099  0.414
1992 Shore RA, Slaman TA. The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory Theoretical Computer Science. 97: 263-284. DOI: 10.1016/0304-3975(92)90078-T  0.347
1992 Downey R, Slaman TA. On co-simple isols and their intersection types Annals of Pure and Applied Logic. 56: 221-237. DOI: 10.1016/0168-0072(92)90074-A  0.306
1992 Maass W, Slaman TA. The complexity types of computable sets Journal of Computer and System Sciences. 44: 168-192. DOI: 10.1016/0022-0000(92)90018-E  0.324
1991 Hinman PG, Slaman TA. Jump embeddings in the Turing degrees Journal of Symbolic Logic. 56: 563-591. DOI: 10.2307/2274700  0.404
1991 Slaman TA. The density of infima in the recursively enumerable degrees Annals of Pure and Applied Logic. 52: 155-179. DOI: 10.1016/0168-0072(91)90044-M  0.336
1990 Sacks GE, Slaman TA. Generalized hyperarithmetic theory Proceedings of the London Mathematical Society. 417-443. DOI: 10.1112/Plms/S3-60.3.417  0.359
1990 Shinoda J, Slaman TA. On the theory of the PTIME degrees of the recursive sets Journal of Computer and System Sciences. 41: 321-366. DOI: 10.1016/0022-0000(90)90024-F  0.359
1989 Slaman TA, Steel JR. Complementation in the Turing degrees Journal of Symbolic Logic. 54: 160-176. DOI: 10.2307/2275022  0.385
1989 Lempp S, Slaman TA. A limit on relative genericity in the recursively enumerable sets Journal of Symbolic Logic. 54: 376-395. DOI: 10.2307/2274854  0.414
1989 Slaman TA. On Bounded Time Turing Reducibility on the Recursive Sets Studies in Logic and the Foundations of Mathematics. 127: 111-112. DOI: 10.1016/S0049-237X(08)70265-9  0.339
1989 Maass W, Slaman TA. Some Problems and Results in the Theory of Actually Computable Functions (preliminary abstract) Studies in Logic and the Foundations of Mathematics. 127: 79-89. DOI: 10.1016/S0049-237X(08)70263-5  0.316
1989 Downey RG, Slaman TA. Completely mitotic R.E. degrees Annals of Pure and Applied Logic. 41: 119-152. DOI: 10.1016/0168-0072(89)90011-0  0.331
1988 Mytilinaios ME, Slaman TA. Σ2-collection and the infinite injury priority method Journal of Symbolic Logic. 53: 212-221. DOI: 10.1017/S0022481200029042  0.337
1986 Slaman TA. Σ1 definitions with parameters Journal of Symbolic Logic. 51: 453-461. DOI: 10.1017/S0022481200031327  0.321
1986 Slaman TA. On the Kleene degrees of Π11 sets Journal of Symbolic Logic. 51: 352-359. DOI: 10.1017/S0022481200031212  0.392
1985 Slaman TA. Reflection and forcing in E-recursion theory Annals of Pure and Applied Logic. 29: 79-106. DOI: 10.1016/0168-0072(85)90036-3  0.307
1983 Groszek MJ, Slaman TA. Independence results on the global structure of the turing degrees Transactions of the American Mathematical Society. 277: 579-588. DOI: 10.1090/S0002-9947-1983-0694377-4  0.357
1983 Slaman TA. The extended plus-one hypothesis—A relative consistency result Nagoya Mathematical Journal. 92: 107-120. DOI: 10.1017/S0027763000020596  0.343
Show low-probability matches.