1. Marker, David and Slaman, Theodore A. (2006). Decidability of the Natural Numbers with the Almost-All Quantifier. preprint. [pdf] [arXiv] [GS][MRef]
2. Slaman, Theodore A. (2004). Σn-Bounding and Δn-Induction. Proc. Amer. Math. Soc. 132 2449--2456. [pdf] [MR] [GS][MRef]
3. Groszek, Marcia J. and Slaman, Theodore A. (1994). On Turing Reducibility. preprint. [pdf] [GS][MRef]
4. 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]
5. 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]