Definability, automorphisms, and dynamic properties of computably enumerable sets

Bulletin of Symbolic Logic

Volumn 2, Issue 2, 1996, Pages 199-213

  Harrington, Leo ^a   Soare, Robert I ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030158744     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2307/421110     Document Type: Article

References (13)

1. P. CHOLAK, R. DOWNEY, and M. STOB, Automorphisms of the lattice of recursively enumerable sets: Promptly simple sets, Transactions of the American Mathematical Society, vol. 332 (1992), pp. 555-570.
2. P. A. CHOLAK, Automorphisms of the lattice of recursively enumerable sets, Memoirs of the American Mathematical Society, vol. 113 (1995).
3. R. DOWNEY and M. STOB, Automorphisms of the lattice of recursively enumerable sets: Orbits, Advances in Mathematics, vol. 92 (1992), pp. 237-265.
4. L. HARRINGTON and R. I. SOARE, Codable sets and orbits of computably enumerable sets, Journal of Symbolic Logic, to appear.
5. -, Definable properties of the computably enumerable sets, in preparation.
6. -, Martin's invariance conjecture and low sets, in preparation.
7. 3-automorphism method and noninvariant classes of degrees, Journal of the American Mathematical Society, to appear.
8. -, Post's program and incomplete recursively enumerable sets, Proceedings of the National Academy of Sciences of the United States of America, vol. 88 (1991), pp. 10242-10246.
9. -, Dynamic properties of computably enumerable sets, Computability, enumerability, unsolvability: Directions in recursion theory (S. B. Cooper, T. A. Slaman, and S. W. Wainer, editors), Proceedings of the Recursion Theory Conference, University of Leeds, Leeds, July, 1994, London Mathematical Society Lecture Notes Series, Cambridge University Press, 1996.
10. th International Congress for Logic, Methodology and the Philosophy of Science, Section 3: Recursion Theory and Constructivism, Florence, August 19-25, 1995, to appear.
11. -, The structure of computably enumerable objects as sets, Handbook of computability theory, North-Holland, Amsterdam, in preparation.
12. -, Recursively enumerable sets and degrees: A study of computable functions and computably generated sets, Springer-Verlag, Heidelberg, 1987.
13. -, Computability and recursion, to appear, 1996.