1. 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]
2. 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]
3. 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]
4. 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]
5. 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]
6. 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]