1. 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]
2. Lempp, Steffen and Nies, André and Slaman, Theodore A. (1998). The Π3-theory of the computably enumerable Turing degrees is undecidable. Trans. Amer. Math. Soc. 350 No.7, 2719--2736. [MR] [GS][MRef]
3. Nies, André and Shore, Richard A. and Slaman, Theodore A. (1998). Interpretability and definability in the recursively enumerable degrees. Proc. London Math. Soc. (3) 77 No.2, 241--291. [MR] [GS][MRef]
4. Slaman, Theodore A. and Woodin, W. Hugh (1997). Definability in the enumeration degrees. Arch. Math. Logic 36 No.4-5, 255--267. Sacks Symposium (Cambridge, MA, 1993). [MR] [GS][MRef]