Coding in the Partial Order of Enumerable Sets

Advances in Mathematics

Volumn 133, Issue 1, 1998, Pages 133-162

  Harrington, Leo ^a   Nies, André ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

Enumerable sets, coding, definability

Indexed keywords

EID: 0040599073     PISSN: 00018708     EISSN: None     Source Type: Journal    
DOI: 10.1006/aima.1997.1687     Document Type: Article

References (18)

1. Feferman, Vaught. The first-order properties of algebraic systems. Fund. Math. 47:1959;57-103.
2. Friedberg M. Three theorems on recursive enumeration. J. Symb. Logic. 23:1958;309-316.
3. Harrington L., Soare R. Post's program and incomplete recursively enumerable sets. Proc. Natl. Acad. Sci. USA. 88:1992;10242-10246.
4. Hodges W., Nies A. Interpreting Infinite Linear Orders. Logic Colloquium 95 Proceedings. 1995;Springer-Verlag, New York/Berlin.
5. Lachlan A. H. The elementary theory of the lattice of recursively enumerable sets. Duke Math. J. 1968;123-146.
6. Lempp S. Hyperarithmetical index sets in recursion theory. Trans. Amer. Math. Soc. 303:1987;559-583.
7. Martin D. A. Classes of recursively enumerable sets and degrees of unsolvability. Z. Math. Logik Grundl. Math. 12:1966;Springer-Verlag, New York/Berlin. p. 295-310.
8. Nies A. The last question on recursively enumerable many-one degrees. Algebra i Logika. 33:1994;550-563.
9. Nies A. Relativizations of structures arising from computability theory. Computability, Enumerability, Unsolvability. London Math. Soc. Lecture Notes Series. 224:1996;Cambridge Univ. Press, Cambridge. p. 219-232.
10. A. Nies, Intervals of the lattice of computably enumerable sets and effective Boolean algebras, Bull. Lond. Math. Soc.
11. A. Nies, Effectively dense Boolean algebras and their applications.
12. A. Nies, Coding and definability in computability theory.
13. A. Nies, R. Shore, T. Slaman, Interpretability and definability in the recursively enumerable Turing degrees.
14. Selivanov V. Fine hierarchies of arithmetical sets and definable index sets. Trudy Inst. Mat. SO AN SSSR. 12:1989;165-185.
15. Shore R. The theory of the degrees below 0'. J. London Math. Soc. 24:1981;1-14.
16. Slaman T. A., Woodin W. H. Definability in the Turing degrees. Illinois J. Math. 30:1986;320-334.
17. Soare R. I. Automorphisms of the lattice of r.e. sets. Ann. of Math. 100:1974;60-120.
18. Soare R. I. Recursively enumerable sets and degrees: The study of computable functions and computably generated sets. Perspectives in Mathematical Logic,Ω 1987;Springer-Verlag, Berlin.