1. Calhoun, William C. and Slaman, Theodore A. (1996). The Π02 enumeration degrees are not dense. J. Symbolic Logic 61 No.4, 1364--1379. [MR] [GS][MRef]
2. 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]
3. Maass, Wolfgang and Slaman, Theodore A. (1990). On the relationship between the complexity, the degree, and the extension of a computable set. In Recursion theory week (Oberwolfach, 1989) Lecture Notes in Math. 1432 297--322 Springer Berlin. [MR] [GS][MRef]