Abstract
The natural embedding of the Turing degrees into the enumeration degrees preserves the jump operation, and maps isomorphically the computably enumerable Turing degrees onto the \({\it \Pi}^0_1\) enumeration degrees. The embedding does not preserve minimal pairs, though, unless one of the two sides is low. In particular it is known that there exist high minimal pairs of c.e. Turing degrees that do not embed to minimal pairs of e-degrees. We show however that high minimal pairs of \({\it \Pi}^0_1\) e-degrees do exist.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cooper, S.B., Copestake, C.S.: Properly Σ 2 enumeration degrees. Z. Math. Logik Grundlag. Math. 34, 491–522 (1988)
Lachlan, A.H.: Lower bounds for pairs of recursively enumerable degrees. Proc. London Math. Soc. 16, 537–569 (1966)
McEvoy, K.: The Structure of the Enumeration Degrees. PhD thesis, School of Mathematics, University of Leeds (1984)
McEvoy, K., Cooper, S.B.: On minimal pairs of enumeration degrees. J. Symbolic Logic 50, 983–1001 (1985)
Shore, R., Sorbi, A.: Jumps of \(\Sigma^0_2\) high e-degrees and properly \(\Sigma^0_2\) e-degrees. In: Arslanov, M., Lempp, S. (eds.) Recursion Theory and Complexity. De Gruyter Series in Logic and Its Applications, pp. 157–172. W. De Gruyter, Berlin (1999)
Yates, C.E.M.: A minimal pair of recursively enumerable degrees. J. Symbolic Logic 31, 159–168 (1966)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sorbi, A., Wu, G., Yang, Y. (2009). High Minimal Pairs in the Enumeration Degrees. In: Chen, J., Cooper, S.B. (eds) Theory and Applications of Models of Computation. TAMC 2009. Lecture Notes in Computer Science, vol 5532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02017-9_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-02017-9_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02016-2
Online ISBN: 978-3-642-02017-9
eBook Packages: Computer ScienceComputer Science (R0)