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