1. 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]
2. 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]
3. 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]
4. 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]
5. 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]
6. 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]
7. 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]
8. 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]
9. 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]
10. 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]
11. 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]
12. 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]
13. 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]
14. 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]
15. 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]
16. 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]
17. 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]
18. 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]
19. 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]
20. 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]
21. 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]
22. Slaman, Theodore A. and Steel, John R. (1989). Complementation in the Turing degrees. J. Symbolic Logic 54 No.1, 160--176. [MR] [GS][MRef]
23. 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]
24. 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]
25. 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]
26. 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]
27. Slaman, Theodore A. (1986). On the Kleene degrees of Π11 sets. J. Symbolic Logic 51 No.2, 352--359. [MR] [GS][MRef]
28. 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]