1. Slaman, Theodore A. (2007). Global Properties of the Turing Degrees and the Turing Jump. preprint. [pdf] [GS][MRef]
2. 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]
3. 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]
4. 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]
5. 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]
6. 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]
7. Slaman, Theodore A. (1999). The global structure of the Turing degrees. In Handbook of computability theory 155--168 North-Holland Amsterdam. [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. Slaman, Theodore A. and Woodin, W. Hugh (1986). Definability in the Turing degrees. Illinois J. Math. 30 No.2, 320--334. [MR] [GS][MRef]