Bibliography (See also Bibserver.)

  1. Noam Greenberg, Antonio Montalbán, and Theodore A. Slaman. The Slaman-Wehner theorem in higher recursion theory. Proc. Amer. Math. Soc., 139:1865–1869, 2011. [ pdf ]
  2. C. T. Chong, Theodore A. Slaman, and Yue Yang. Π11-conservation of combinatorial principles weaker than Ramsey's theorem for pairs. preprint, 2010. [ pdf ]
  3. George Barmpalias, Noam Greenberg, Antonio Montalbán, and Theodore A. Slaman. K-trivials are never continuously random. preprint, 2010. [ arXiv ]
  4. Peter A. Cholak, Carl G. Jockusch, Jr., and Theodore A. Slaman. Corrigendum to: “On the strength of Ramsey's theorem for pairs” [mr1825173]. J. Symbolic Logic, 74(4):1438–1439, 2009. [ www ]
  5. Denis R. Hirschfeldt, Richard A. Shore, and Theodore A. Slaman. The atomic model theorem and type omitting. Trans. Amer. Math. Soc., 361(11):5805–5837, 2009.
  6. Chi Tat Chong and Theodore A. Slaman. The theory of the α degrees is undecidable. Israel Journal of Mathematics, 178:229–252, 2010. [ pdf ]
  7. Denis R. Hirschfeldt, Carl G. Jockusch, Jr., Bjørn Kjos-Hanssen, Steffen Lempp, and Theodore A. Slaman. The strength of some combinatorial principles related to Ramsey's theorem for pairs. In Chitat Chong, Qi Feng, Theodore A. Slaman, W. Hugh Woodin, and Yue Yang, editors, Computational Prospects of Infinity. Part I: Presented Talks, volume 14 of Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, pages 143–161. World Scientific, 2008. [ pdf ]
  8. Chitat Chong, Qi Feng, Theodore A. Slaman, W. Hugh Woodin, and Yue Yang, editors. Computational Prospects of Infinity. Part II: Presented Talks, volume 15 of Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore. World Scientific, 2008.
  9. Theodore A. Slaman. Global properties of the Turing degrees and the Turing jump. In Chitat Chong, Qi Feng, Theodore A. Slaman, W. Hugh Woodin, and Yue Yang, editors, Computational Prospects of Infinity. Part I: Tutorials, volume 14 of Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, pages 83–101. World Scientific, 2008. [ pdf ]
  10. Chitat Chong, Qi Feng, Theodore A. Slaman, W. Hugh Woodin, and Yue Yang, editors. Computational Prospects of Infinity. Part I: Tutorials, volume 14 of Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore. World Scientific, 2008.
  11. Jan Reimann and Theodore A. Slaman. Measures and their random reals. preprint, 2008. [ arXiv ]
  12. Klaus Ambos-Spies, Steffen Lempp, and Theodore A. Slaman. Generating sets for the recursively enumerable Turing degrees. In Chitat Chong, Qi Feng, Theodore A. Slaman, W. Hugh Woodin, and Yue Yang, editors, Computational Prospects of Infinity. Part I: Presented Talks, volume 14 of Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, pages 1–22. World Scientific, 2008. [ pdf ]
  13. Antonín Kučera and Theodore A. Slaman. Low upper bounds of ideals. J. Symbolic Logic, 74:517–534, 2007. [ arXiv | pdf ]
  14. Jan Reimann and Theodore A. Slaman. Probability measures and effective randomness. preprint, 2007. [ arXiv | pdf ]
  15. Steffen Lempp and Theodore A. Slaman. The complexity of the index sets of ℵ0-categorical theories and of Ehrenfeucht theories. In Advances in logic, volume 425 of Contemp. Math., pages 43–47. Amer. Math. Soc., Providence, RI, 2007. [ arXiv | pdf ]
  16. Antonín Kučera and Theodore A. Slaman. Turing incomparability in Scott sets. Proc. Amer. Math. Soc., 135:3723–3731, 2007. [ arXiv | pdf ]
  17. David Marker and Theodore A. Slaman. Decidability of the natural numbers with the almost-all quantifier. preprint, 2006. [ arXiv | pdf ]
  18. Bakhadyr Khoussainov, Pavel Semukhin, and Theodore A. Slaman. On Π01-presentations of algebras. Arch. Math. Logic, 45:769–781, 2006. [ pdf ]
  19. Richard A. Shore and Theodore A. Slaman. The ∀∃ theory of r D(≤,∨,') is undecidable. In Logic Colloquium '03, volume 24 of Lect. Notes Log., pages 326–344. Assoc. Symbol. Logic, La Jolla, CA, 2006. [ pdf ]
  20. Noam Greenberg, Richard A. Shore, and Theodore A. Slaman. The theory of the metarecursively enumerable degrees. J. Math. Log., 6(1):49–68, 2006. [ pdf ]
  21. Bakhadyr Khoussainov, Steffen Lempp, and Theodore A. Slaman. Computably enumerable algebras, their expansions, and isomorphisms. International Journal of Algebra and Computation, 15(3):437–454, June 2005. [ pdf ]
  22. Theodore A. Slaman. Aspects of the Turing jump. In René Cori, Alexander Razborov, Stevo Todorčević, and Carol Wood, editors, Logic Colloquium 2000, Proceedings of the Annual Summer Meeting of the Association for Symbolic Logic, held in Paris, France, July 23-31, 2000, pages 365–382. A K Peters, Ltd., Wellesley, Massachusetts, 2005. [ pdf ]
  23. Steffen Lempp, Theodore A. Slaman, and Andrea Sorbi. On extensions of embeddings into the enumeration degrees of the Σ02-sets. Journal of Mathematical Logic, 5(2):247–298, 2005. [ pdf ]
  24. Wolfgang Merkle, Nenad Mihailović, and Theodore A. Slaman. Some results on effective randomness. In Automata, languages and programming, volume 3142 of Lecture Notes in Comput. Sci., pages 983–995. Springer, Berlin, 2004. [ pdf ]
  25. Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, and Theodore A. Slaman. Comparing DNR and WWKL0. J. Symbolic Logic, 69(4):1089–1104, 2004. [ pdf ]
  26. Theodore A. Slaman. Σn-bounding and Δn-induction. Proc. Amer. Math. Soc., 132:2449–2456, 2004. [ pdf ]
  27. Michael E. Mytilinaios and Theodore A. Slaman. Differences between resource bounded degree structures. Notre Dame J. Formal Logic, 44(1):1–12, 2003. [ pdf ]
  28. Peter Cholak, Marcia Groszek, and Theodore Slaman. An almost deep degree. J. Symbolic Logic, 66(2):881–901, 2001. [ pdf ]
  29. Peter A. Cholak, Carl G. Jockusch, Jr., and Theodore A. Slaman. On the strength of Ramsey's theorem for pairs. J. Symbolic Logic, 66(1):1–55, 2001. [ pdf ]
  30. C. T. Chong, Lei Qian, Theodore A. Slaman, and Yue Yang. Σ2 induction and infinite injury priority arguments. III. Prompt sets, minimal pairs and Shoenfield's conjecture. Israel J. Math., 121:1–28, 2001. [ pdf ]
  31. Antonín Kučera and Theodore A. Slaman. Randomness and recursive enumerability. SIAM J. Comput., 31(1):199–211 (electronic), 2001. [ pdf ]
  32. Angsheng Li, Theodore A. Slaman, and Yue Yang. A non-low2 c.e. degree which bounds no diamond bases. preprint, 2001.[ pdf ]
  33. Richard A. Shore and Theodore A. Slaman. A splitting theorem for n-REA degrees. Proc. Amer. Math. Soc., 129(12):3721–3728 (electronic), 2001. [ pdf ]
  34. Theodore A. Slaman and Robert I. Soare. Extension of embeddings in the computably enumerable degrees. Ann. of Math. (2), 154(1):1–43, 2001. [ pdf ]
  35. Richard J. Coles, Rod G. Downey, and Theodore A. Slaman. Every set has a least jump enumeration. J. London Math. Soc. (2), 62(3):641–649, 2000. [ pdf ]
  36. Juichi Shinoda and Theodore A. Slaman. Recursive in a generic real. J. Symbolic Logic, 65(1):164–172, 2000. [ pdf ]
  37. Theodore A. Slaman. Recursion theory in set theory. In Computability theory and its applications (Boulder, CO, 1999), pages 273–278. Amer. Math. Soc., Providence, RI, 2000. [ pdf ]
  38. Richard A. Shore and Theodore A. Slaman. Defining the Turing jump. Math. Res. Lett., 6(5-6):711–722, 1999. [ pdf ]
  39. Theodore A. Slaman. On a question of Sierpiński. Fund. Math., 159(2):153–159, 1999. [ pdf ]
  40. Theodore A. Slaman. The global structure of the Turing degrees. In Handbook of computability theory, pages 155–168. North-Holland, Amsterdam, 1999.
  41. Marat M. Arslanov, Geoffrey L. LaForte, and Theodore A. Slaman. Relative enumerability in the difference hierarchy. J. Symbolic Logic, 63(2):411–420, 1998.
  42. Marcia J. Groszek and Theodore A. Slaman. A basis theorem for perfect sets. Bull. Symbolic Logic, 4(2):204–209, 1998. [ pdf ]
  43. Steffen Lempp, André Nies, and Theodore A. Slaman. The Π3-theory of the computably enumerable Turing degrees is undecidable. Trans. Amer. Math. Soc., 350(7):2719–2736, 1998.
  44. André Nies, Richard A. Shore, and Theodore A. Slaman. Interpretability and definability in the recursively enumerable degrees. Proc. London Math. Soc. (3), 77(2):241–291, 1998.
  45. Theodore A. Slaman and A. Sorbi. Quasi-minimal enumeration degrees and minimal Turing degrees. Ann. Mat. Pura Appl. (4), 174:97–120, 1998.
  46. Theodore A. Slaman and W. Hugh Woodin. Extending partial orders to dense linear orders. Ann. Pure Appl. Logic, 94(1-3):253–261, 1998. Conference on Computability Theory (Oberwolfach, 1996).
  47. Theodore A. Slaman. Relative to any nonrecursive set. Proc. Amer. Math. Soc., 126(7):2117–2122, 1998.
  48. Theodore A. Slaman. Mathematical definability. In Truth in mathematics (Mussomeli, 1995), pages 233–251. Oxford Univ. Press, New York, 1998.
  49. Klaus Ambos-Spies and Theodore A. Slaman, editors. Conference on Computability Theory, Amsterdam, 1998. North-Holland Publishing Co. Ann. Pure Appl. Logic 94 (1998), no. 1-3.
  50. Marcia J. Groszek and Theodore A. Slaman. Π01 classes and minimal degrees. Ann. Pure Appl. Logic, 87(2):117–144, 1997. Logic Colloquium '95 Haifa.
  51. Christine Ann Haught and Theodore A. Slaman. Automorphisms in the PTIME-Turing degrees of recursive sets. Ann. Pure Appl. Logic, 84(1):139–152, 1997. Fifth Asian Logic Conference (Singapore, 1993).
  52. Theodore A. Slaman and W. Hugh Woodin. Definability in the enumeration degrees. Arch. Math. Logic, 36(4-5):255–267, 1997. Sacks Symposium (Cambridge, MA, 1993).
  53. William C. Calhoun and Theodore A. Slaman. The Π02 enumeration degrees are not dense. J. Symbolic Logic, 61(4):1364–1379, 1996.
  54. S. B. Cooper, T. A. Slaman, and S. S. Wainer, editors. Computability, enumerability, unsolvability. Cambridge University Press, Cambridge, 1996. Directions in recursion theory.
  55. Marcia J. Groszek, Michael E. Mytilinaios, and Theodore A. Slaman. The Sacks density theorem and Σ2-bounding. J. Symbolic Logic, 61(2):450–467, 1996.
  56. Michael E. Mytilinaios and Theodore A. Slaman. On a question of Brown and Simpson. In Computability, enumerability, unsolvability, volume 224 of London Math. Soc. Lecture Note Ser., pages 205–218. Cambridge Univ. Press, Cambridge, 1996.
  57. André Nies, Richard A. Shore, and Theodore A. Slaman. Definability in the recursively enumerable degrees. Bull. Symbolic Logic, 2(4):392–404, 1996.
  58. David Seetapun and Theodore A. Slaman. On the strength of Ramsey's theorem. Notre Dame J. Formal Logic, 36(4):570–582, 1995. Special Issue: Models of arithmetic.
  59. Theodore A. Slaman and Robert I. Soare. Algebraic aspects of the computably enumerable degrees. Proc. Nat. Acad. Sci. U.S.A., 92(2):617–621, 1995.
  60. L. Fortnow, W. Gasarch, S. Jain, E. Kinber, M. Kummer, S. Kurtz, M. Pleszkoch, T. Slaman, R. Solovay, and F. Stephan. Extremes in the degrees of inferability. Ann. Pure Appl. Logic, 66(3):231–276, 1994.
  61. Marcia J. Groszek and Theodore A. Slaman. On Turing reducibility. preprint, 1994. [ pdf ]
  62. C. J. Ash, J. F. Knight, and T. A. Slaman. Relatively recursive expansions. II. Fund. Math., 142(2):147–161, 1993.
  63. Carl G. Jockusch, Jr. and Theodore A. Slaman. On the Σ2-theory of the upper semilattice of Turing degrees. J. Symbolic Logic, 58(1):193–204, 1993.
  64. Richard A. Shore and Theodore A. Slaman. Working below a high recursively enumerable degree. J. Symbolic Logic, 58(3):824–859, 1993.
  65. P. Cholak, R. Downey, L. Fortnow, W. Gasarch, E. Kinber, M. Kummer, S. Kurtz, and T. Slaman. Degrees of inferability. In Fifth Annual Conference on Computational Learning Theory, pages 180–192. ACM, 1992.
  66. Rod Downey and Theodore A. Slaman. On co-simple isols and their intersection types. Ann. Pure Appl. Logic, 56(1-3):221–237, 1992.
  67. Wolfgang Maass and Theodore A. Slaman. Splitting and density for the recursive sets of a fixed time complexity. In Logic from computer science (Berkeley, CA, 1989), volume 21 of Math. Sci. Res. Inst. Publ., pages 359–372. Springer, New York, 1992.
  68. Wolfgang Maass and Theodore A. Slaman. The complexity types of computable sets. J. Comput. System Sci., 44(2):168–192, 1992.
  69. Richard A. Shore and Theodore A. Slaman. The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory. Theoret. Comput. Sci., 97(2):263–284, 1992.
  70. Peter G. Hinman and Theodore A. Slaman. Jump embeddings in the Turing degrees. J. Symbolic Logic, 56(2):563–591, 1991.
  71. Theodore A. Slaman and Robert M. Solovay. When oracles do not help. In Fourth Annual Workshop on Computational Learning Theory, pages 379–383, Los Altos, CA, 1991. Morgan Kaufman.
  72. Theodore A. Slaman. Degree structures. In Proceedings of the International Congress of Mathematicians, Vol. I, II (Kyoto, 1990), pages 303–316, Tokyo, 1991. Math. Soc. Japan.
  73. Theodore A. Slaman. The density of infima in the recursively enumerable degrees. Ann. Pure Appl. Logic, 52(1-2):155–179, 1991. International Symposium on Mathematical Logic and its Applications (Nagoya, 1988).
  74. Wolfgang Maass and Theodore A. Slaman. On the relationship between the complexity, the degree, and the extension of a computable set. In Recursion theory week (Oberwolfach, 1989), volume 1432 of Lecture Notes in Math., pages 297–322. Springer, Berlin, 1990.
  75. Gerald E. Sacks and Theodore A. Slaman. Generalized hyperarithmetic theory. Proc. London Math. Soc. (3), 60(3):417–443, 1990.
  76. Juichi Shinoda and Theodore A. Slaman. On the theory of the PTIME degrees of the recursive sets. J. Comput. System Sci., 41(3):321–366, 1990.
  77. Richard A. Shore and Theodore A. Slaman. Working below a low2 recursively enumerable degree. Arch. Math. Logic, 29(3):201–211, 1990.
  78. Chris Ash, Julia Knight, Mark Manasse, and Theodore Slaman. Generic copies of countable structures. Ann. Pure Appl. Logic, 42(3):195–205, 1989.
  79. R. G. Downey and T. A. Slaman. Completely mitotic r.e. degrees. Ann. Pure Appl. Logic, 41(2):119–152, 1989.
  80. Steffen Lempp and Theodore A. Slaman. A limit on relative genericity in the recursively enumerable sets. J. Symbolic Logic, 54(2):376–395, 1989.
  81. W. Maass and Theodore A. Slaman. The complexity types of computable sets. In Annual Conference on Structure in Complexity Theory, 1989.
  82. Wolfgang Maass and Theodore A. Slaman. Some problems and results in the theory of actually computable functions (preliminary abstract). In Logic Colloquium '88 (Padova, 1988), volume 127 of Stud. Logic Found. Math., pages 79–89. North-Holland, Amsterdam, 1989.
  83. Wolfgang Maass and Theodore A. Slaman. Extensional properties of sets of time bounded complexity (extended abstract). In Fundamentals of computation theory (Szeged, 1989), volume 380 of Lecture Notes in Comput. Sci., pages 318–326. Springer, New York, 1989.
  84. J. Shinoda, T. A. Slaman, and T. Tugué, editors. Mathematical logic and applications, volume 1388 of Lecture Notes in Mathematics, Berlin, 1989. Springer-Verlag.
  85. Juichi Shinoda and Theodore A. Slaman. The continuum hypothesis and the theory of the Kleene degrees. In Mathematical logic and applications (Kyoto, 1987), volume 1388, pages 153–177. Springer, Berlin, 1989.
  86. Richard A. Shore and Theodore A. Slaman. The P-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two quantifier theory (extended abstract). In Annual Conference on Structure in Complexity Theory, 1989.
  87. Theodore A. Slaman and John R. Steel. Complementation in the Turing degrees. J. Symbolic Logic, 54(1):160–176, 1989.
  88. Theodore A. Slaman and W. Hugh Woodin. Σ1-collection and the finite injury priority method. In Mathematical logic and applications (Kyoto, 1987), volume 1388 of Lecture Notes in Math., pages 178–188. Springer, Berlin, 1989.
  89. Theodore A. Slaman. On bounded time Turing reducibility on the recursive sets. In Logic Colloquium '88 (Padova, 1988), volume 127 of Stud. Logic Found. Math., pages 111–112. North-Holland, Amsterdam, 1989.
  90. Michael E. Mytilinaios and Theodore A. Slaman. Σ2-collection and the infinite injury priority method. J. Symbolic Logic, 53(1):212–221, 1988.
  91. Juichi Shinoda and Theodore A. Slaman. On the theory of the PTIME degrees of the recursive sets. In Annual Conference on Structure in Complexity Theory, 1988.
  92. Theodore A. Slaman and John R. Steel. Definable functions on degrees. In Cabal Seminar 81-85, volume 1333 of Lecture Notes in Math., pages 37–55. Springer, Berlin, 1988.
  93. G. E. Sacks and T. A. Slaman. Inadmissible forcing. Adv. in Math., 66(1):1–30, 1987.
  94. Theodore A. Slaman and W. Hugh Woodin. Definability in the Turing degrees. Illinois J. Math., 30(2):320–334, 1986.
  95. T. A. Slaman. Σ1-definitions with parameters. J. Symbolic Logic, 51(2):453–461, 1986.
  96. Theodore A. Slaman. On the Kleene degrees of Π11 sets. J. Symbolic Logic, 51(2):352–359, 1986.
  97. Theodore A. Slaman. Reflection and the priority method in E-recursion theory. In Recursion theory week (Oberwolfach, 1984), volume 1141 of Lecture Notes in Math., pages 372–404. Springer, Berlin, 1985.
  98. Theodore A. Slaman. The E-recursively enumerable degrees are dense. In Recursion theory (Ithaca, N.Y., 1982), volume 42 of Proc. Sympos. Pure Math., pages 195–213. Amer. Math. Soc., Providence, RI, 1985.
  99. Theodore A. Slaman. Reflection and forcing in E-recursion theory. Ann. Pure Appl. Logic, 29(1):79–106, 1985.
  100. Marcia J. Groszek and Theodore A. Slaman. Independence results on the global structure of the Turing degrees. Trans. Amer. Math. Soc., 277(2):579–588, 1983.
  101. Theodore A. Slaman. The extended plus-one hypothesis–a relative consistency result. Nagoya Math. J., 92:107–120, 1983.
  102. Theodore A. Slaman. Aspects of E-Recursion Theory. PhD thesis, Harvard University, 1981.
  103. E. E. Gross, M. L. Halbert, D. C. Hensley, D. L. Hillis, C. R. Bingham, Alan Scott, F. Todd Baker, and T. Slaman. Elastic scattering of 70 MeV12C ions from even Nd isotopes. Bull. Am. Phys. Soc., 20:1192, 1975.
  104. D. L. Hillis, E. E. Gross, D. C. Hensley, C. R. Bingham, Alan Scott, F. Todd Baker, and T. A. Slaman. Shape effects in the inelastic scattering of 70 MeV12C ions from 142, 144, 146, 148, 150 Nd. Bull. Am. Phys. Soc., 20:1192, 1975.