Abstract
In this paper, we study the extensions of embeddings in the computably enumerable Turing degrees. We show that for any c.e. degrees \({\bf x\not\leq y}\), if either y is low or x is high, then there is a c.e. degree a such that both 0 < a ≤ x and \({\bf x\not\leq y\cup a}\) hold.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Lachlan, A.H.: Lower bounds for pairs of recursively enumerable degrees. Proc. London Math. Soc. 16, 537–569 (1966)
Barmpalias, Cooper, Li, Xia, Yao, Super minimal pairs (in progress)
Yates, C.E.M.: Three theorems on the degrees of recursively enumerable sets. Duke Math. J.32, 461–468 (1965)
Miller, D.: High recursively enumerable degrees and the anti-cupping property. In: Lerman, Schmerl, and Soare, pp. 230–245 (1981)
Shoenfield, J.R.: Application of model theory to degrees of unsolvability. In: Addison, Henkin, and Tarski, pp. 359–363 (1965)
Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Heidelberg (1987)
Robinson, R.W.: Interpolation and embedding in the recursively enumerable degrees. Ann. of Math. 2(93), 285–314 (1971)
Cooper, S.B.: Computability Theory. Chapman Hall/CRC Mathematics Series, vol. 26 (2003)
Slaman, T.A.: The recursively enumerable degrees as a substructure of the \({\Delta^{0}_{2}}\) degrees (1983) (unpublished notes)
Slaman, T.A., Soare, R.I.: Algebraic aspects of the computably enumerable degrees. Proceedings of the National Academy of Science, USA 92, 617–621 (1995)
Slaman, T.A., Soare, R.I.: Extension of embeddings in the computably enumerable degrees. Ann. of Math (2) 154(1), 1–43 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, J. (2008). Extensions of Embeddings in the Computably Enumerable Degrees. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2008. Lecture Notes in Computer Science, vol 4978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79228-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-79228-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79227-7
Online ISBN: 978-3-540-79228-4
eBook Packages: Computer ScienceComputer Science (R0)