Abstract
It is shown that for any 2-computably enumerable Turing degrees a, l, if l ′ = 0′, and l < a, then there are 2-computably enumerable Turing degrees x 0, x 1 such that both l ≤ x 0, x 1 < a and x 0 ∨ x 1 = a hold, extending the Robinson low splitting theorem for the computably enumerable degrees to the difference hierarchy.
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
Arslanov, M.M.: Structural properties of the degrees below 0’. Dokl. Akad. Nauk SSSR (N.S.) 283, 270–273 (1985)
Arslanov, M.M.: Open questions about the n-c.e. degrees. In: Merman, M., Cholak, P., Lempp, S., Shore, R.A. (eds.) Computability Theory and Its Applications: Current Trends and Open Problems. Contemporary Mathematics, vol. 257, pp. 15–22 (2000)
Arslanov, M.M., Cooper, S.B., Li, A.: There is no low maximal d.c.e. degree. Math. Logic Quart. 46, 409–416 (2000); 50(6), 628–636 (2004)
Cooper, S.B.: Minimal degrees and the jump operator. J. Symbolic Logic 38, 249–271 (1973)
Cooper, S.B.: On a theorem of C. E. M. Yates (1974), handwritten notes
Cooper, S.B.: A splitting theorem for the n-r.e. degrees. Proc. Amer. Math. Soc. 115, 461–471 (1992)
Cooper, S.B., Harrington, L., Lachlan, A.H., Lempp, S., Soare, R.I.: The d-r.e. degrees are not dense. Ann. Pure Appl. Logic 55, 125–151 (1991)
Cooper, S.B., Lempp, S., Watson, P.: Weak density and cupping in the d-r.e. degrees. Israel J. Math. 67, 137–152 (1989)
Cooper, S.B., Li, A.: Turing definability in the Ershov hierarchy. J. London Math. Soc. 66(2), 513–528 (2002)
Downey, R.: D.r.e. degrees and the nondiamond theorem. Bull. London Math. Soc. 21, 43–50 (1989)
Ershov, Y.L.: A hierarchy of sets, Part I. Algebra i Logika 7, 47–73 (1968) (Russian); Algebra and Logic 7, 24–43 (1968) (English translation)
Ershov, Y.L.: A hierarchy of sets, Part II. Algebra i Logika 7, 15–47 (1968) (Russian); Algebra and Logic 7, 212–232 (1968) (English translation)
Lachlan, A.H.: Lower bounds for pairs of recursively enumerable degrees. Proc. London Math. Soc. 16(3), 537–569 (1966)
Li, A., Yi, X.: Cupping the recursively enumerable degrees by d.r.e. degrees. Proc. London Math. Soc. 78(3), 1–21 (1999)
Robinson, R.W.: Interpolation and embedding in the recursively enumerable degrees. Ann. of Math. 93(2), 285–314 (1971)
Sacks, G.E.: On the degrees less than 0’. Ann. of Math. 77, 211–231 (1963)
Sacks, G.E.: The recursively enumerable degrees are dense. Ann. of Math. 80(2), 300–312 (1964)
Soare, R.I.: Recursively enumerable sets and degrees. Springer, Heidelberg (1987)
Yates, C.E.M.: Initial segments of the degrees of unsolvability, Part II: minimal degrees. J. Symbolic Logic 35, 243–266 (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, A. (2005). The Low Splitting Theorem in the Difference Hierarchy. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_35
Download citation
DOI: https://doi.org/10.1007/11494645_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26179-7
Online ISBN: 978-3-540-32266-5
eBook Packages: Computer ScienceComputer Science (R0)