Abstract.
We prove that every non-computable incomplete computably enumerable degree is locally non-cappable, and use this result to show that there is no maximal non-bounding computably enumerable degree.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cooper, S.B.: Minimal pairs and high recursively enumerable degrees. J. Symbolic Logic 39, 655–60 (1974)
Downey, R.G., Lempp, S., Shore, R.A.: Highness and bounding minimal pairs. Math. Logic Quarterly 39, 475–91 (1993)
Harrington, L.A., Soare, R.I.: Games in recursion theory and continuity properties of capping degrees. In: H. Judah, W. Just, W. Hugh Woodin, (eds), Set Theory of the Continuum, volume 26 of Mathematical Sciences Research Institute Publications, Berkeley, CA, 1989, 1992, pp. 39–62, Springer
Lachlan, A.H.: Bounding minimal pairs. J. Symbolic Logic 44, 626–42 (1979)
Seetapun, D.: Contributions to Recursion Theory. Ph.D. thesis, Trinity College, Cambridge, 1991
Soare, R.I.: Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic. Springer-Verlag, 1987
Welch, L.V.: A Hierarchy of Families of Recursively Enumerable Degrees and a Theorem on Bounding Minimal Pairs. Ph.D. dissertation, University of Illinois at Urbana-Champaign, 1981
Author information
Authors and Affiliations
Corresponding author
Additional information
The author was supported by an EPSRC Research Studentship.
Mathematics Subject Classification (2000):03D25
Keywords or phrases:Computably enumerable – Degree
Rights and permissions
About this article
Cite this article
Giorgi, M. The computably enumerable degrees are locally non-cappable. Arch. Math. Logic 43, 121–139 (2004). https://doi.org/10.1007/s00153-003-0187-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-003-0187-x