Definability in the recursively enumerable degrees

Bulletin of Symbolic Logic

Volumn 2, Issue 4, 1996, Pages 392-404

  Nies, André ^a   Shore, Richard A ^b   Slaman, Theodore A ^c  

^a UNIVERSITY OF CHICAGO   (United States)

^b Cornell University ^*  (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030299478     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2307/421171     Document Type: Article

References (33)

1. [1984] K. AMBOS-SPIES, C. G. JOCKUSCH, JR., R. A. SHORE, and R. I. SOARE, An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees, Transactions of the American Mathematical Society, vol. 281, pp. 109-128.
2. [1993] K. AMBOS-SPIES and R. A. SHORE, Undecidability and 1-types in the r.e. degrees, Annals of Pure and Applied Logic, vol. 63, pp. 3-37.
3. [1996] S. B. COOPER, Beyond Gödel's theorem: the failure to capture information content, University of Leeds, Department of Pure Mathematics, preprint series, no. 4.
4. [1990] R. G. DOWNEY, Lattice nonembeddings and initial segments of the recursively enumerable degrees, Annals of Pure and Applied Logic, vol. 49, pp. 97-119.
5. [1957] R. M. FRIEDBERG, Two recursively enumerable sets of incomparable degrees of unsolvability, Proceeding of the National Academy of Sciences, vol. 43, pp. 236-238.
6. [1982] L. HARRINGTON and S. SHELAH, The undecidability of the recursively enumerable degrees (research announcement), Bulletin of the American Mathematical Society, New Series, vol. 6, pp. 79-80.
7. [1993] W. HODGES, Model theory, Cambridge University Press, Cambridge, England.
8. [1983] C. G. JR. JOCKUSCH and R. A. SHORE, Pseudo-jump operators I: the r.e. case, Transactions of the American Mathematical Society, vol. 275, pp. 599-609.
9. [1966] A. H. LACHLAN, Lower bounds for pairs of recursively enumerable degrees, Proceedings of the London Mathematical Society, vol. 16, pp. 537-569.
10. [1966a] _, The impossibility of finding relative complements for recursively enumerable degrees, Journal of Symbolic Logic, vol. 31, pp. 434-454.
11. [1972] _, Embedding nondistributive lattices in the recursively enumerable degrees, Conference in Mathematical Logic, London, 1970 (W. Hodges, editor), LNMS, vol. 255, Springer-Verlag, Berlin, pp. 149-172.
12. [1975] _, A recursively enumerable degree which will not split over all lesser ones, Annals of Mathematical Logic, vol. 9, pp. 307-365.
13. [1980] A. H. LACHLAN and R. I. SOARE, Not every finite lattice is embeddable in the recursively enumerable degrees, Advances in Mathematics, vol. 37, pp. 74-82.
14. [1956] A. A. MUCHNIK, On the unsolvability of the problem of reducibility in the theory of algorithms, Doklady Akademiya Nauk SSSR, New Series, vol. 108, pp. 29-32.
15. [1958] _, Solution of Post's reduction problem and of certain other problems in the theory of algorithms, Trudy Moskovskogo Matematicheskogo Obshchestva, vol. 7, pp. 391-405.
16. [1992] A. NIES, Definability and undecidability in recursion theoretic semilattices, Ph.D. thesis, Universität Heidelberg.
17. [1944] E. L. POST, Recursively enumerable sets of positive integers and their decision problems, Bulletin of the American Mathematical Society, vol. 50, pp. 284-316.
18. [1971] R. W. ROBINSON, Interpolation and embedding in the recursively enumerable degrees, Annals of Mathematics. Second Series, vol. 93, pp. 285-314.
19. [1963] G. E. SACKS, Degrees of unsolvability, Annals of Mathematics Studies, vol. 55, Princeton University Press, Princeton, NJ.
20. [1963a] _, Recursive enumerability and the jump operator, Transactions of the American Mathematical Society, vol. 108, pp. 223-239.
21. [1963b] _, On the degrees less than 0′, Annals of Mathematics. Second Series, vol. 77, pp. 211-231.
22. [1964] _, The recursively enumerable degrees are dense, Annals of Mathematics. Second Series, vol. 80, pp. 300-312.
23. [1966] _, Degrees of unsolvability, Annals of Mathematics Studies, vol. 55, Princeton University Press, Princeton, NJ, second ed.
24. [1965] J. R. SHOENFIELD, An application of model theory to degrees of unsolvability, Symposium on the theory of models (J. W. Addison, L. Henkin, and A. Tarski, editors), North-Holland, Amsterdam, pp. 359-363.
25. [1979] R. A. SHORE, The homogeneity conjecture, Proceedings of the National Academy of Sciences, vol. 76, pp. 4218-4219.
26. [1981] _, The theory of the degrees below 0′, Journal of the London Mathematical Society, vol. 76, pp. 1-14.
27. [1982] _, Finitely generated codings and the degrees r. e. in a degree d, Proceedings of the American Mathematical Society, vol. 84, pp. 256-263.
28. [1982a] _, On homogeneity and definability in the first order theory of the Turing degrees, Journal of Symbolic Logic, vol. 47, pp. 8-16.
29. 2 recursively enumerable degree, Archive for Mathematical Logic, vol. 29, pp. 201-211.
30. [1991] T. A. SLAMAN, Degree structures, Proceedings of the International Congress on Mathematics, Kyoto 1990, Springer-Verlag, pp. 303-316.
31. [1987] R. I. SOARE, Recursively enumerable sets and degrees, Springer-Verlag, Berlin.
32. [1988] B. J. WEINSTEIN, On embeddings of the 1-3-1 into the recursively enumerable degrees, Ph.D. thesis, University of California, Berkeley.
33. [1966] C. E. M. YATES, A minimal pair of recursively enumerable degrees, Journal of Symbolic Logic, vol. 31, pp. 159-168.