1. 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]
2. Slaman, Theodore A. (1999). On a question of Sierpiński. Fund. Math. 159 No.2, 153--159. [pdf] [MR] [GS][MRef]
3. 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]
4. 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]
5. Sacks, Gerald E. and Slaman, Theodore A. (1990). Generalized hyperarithmetic theory. Proc. London Math. Soc. (3) 60 No.3, 417--443. [MR] [GS][MRef]