This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
Klaus Ambos-Spies , Contiguous r.e. degrees, Computation and proof theory (Aachen, 1983), Springer, Berlin, pp. 1–37.
R. G. Downey , Localization of a theorem of Ambos-Spies and the strong antisplitting property, Archiv für Mathematiscke Logik and Grundlagenforschung, vol. 26, no. 3-4. pp. 127–127.
R. G. Downey and M. Stob , Structural interactions of the recursively enumerable T- and w-degrees, Annals of Pure and Applied Logic, vol. 31, no. 2-3, pp. 205–236, Special issue: second Southeast Asian logic conference (Bangkok, 1984).
Rodney G. Downey , Lattice nonembeddings and initial segments of the recursively enumerable degrees, Annals of Pure and Applied Logic, vol. 49, pp. 97–119.
Rodney G. Downey , C. G. Jockusch , and Michael Stob , Array nonrecursive sets and multiple permitting arguments, Recursion theory week (Proceedings, Oberwolfach 1989) (K. Ambos-Spies , G. H. Müller , and G. E. Sacks , editors). Lecture Notes in Mathematics, no. 1432. Springer-Verlag, pp. 141–173.
Rodney G. Downey , Steffen Lempp , and Richard A. Shore , Highness and bounding minimal pairs, Mathematical Logic Quarterly, vol. 39, no. 4, pp. 475–491.
Rodney G. Downey and R. A. Shore , Lattice embeddings below a nonlowi recursively enumerable degree, Israel Journal of Mathematics, vol. 94, pp. 221–246.
Rodney G. Downey and Michael Stob , Splitting theorems in recursion theory, Annals of Pure and Applied Logic, vol. 65, pp. 1–106.
R. E. Ladner and L. P. Sasso , The weak truth table degrees of recursively enumerable sets, Annals of Mathematical Logic, vol. 8, pp. 429–448.
Steffen Lempp , André Nies , and Theodore A. Slaman , The Π3-theory of the computably enumerable Turing degrees is undecidable, Transactions of the American Mathematical Society, vol. 350, no. 7, pp. 2719–2736.
André Nies , Definability in the c.e. degrees: questions and results, Computability theory and its applications (Boulder, CO, 1999) (Peter Cholak , Steffen Lempp , Manny Lerman , and Richard Shore , editors). American Mathematical Society, Providence, RI, pp. 207–213.
André Nies , Richard A. Shore , and Theodore A. Slaman , Interpretability and definability in the recursively enumerable degrees, Proceedings of the London Mathematical Society. Third Series, vol. 77, no. 2, pp. 241–291.
Richard A. Shore , Natural definability in degree structures, Computability theory and its applications (Boulder, CO, 1999) (Peter Cholak , Steffen Lempp , Manny Lerman , and Richard Shore , editors), American Mathematical Society, Providence, RI, pp. 255–271.
R. I. Soare , Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Omega Series, Springer-Verlag, New York.