Advertisement

Russian Mathematics

, Volume 54, Issue 12, pp 51–58 | Cite as

Decomposability of low 2-computably enumerable degrees and turing jumps in the Ershov hierarchy

  • M. Kh. FaizrakhmanovEmail author
Article

Abstract

In this paper we prove the following theorem: For every notation of a constructive ordinal there exists a low 2-computably enumerable degree that is not splittable into two lower 2-computably enumerable degrees whose jumps belong to the corresponding Δ-level of the Ershov hierarchy.

Key words and phrases

low degrees 2-computably enumerable degrees Ershov hierarchy Turing jumps constructive ordinals 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Yu. L. Ershov, “A Hierarchy of Sets. I”, Algebra i Logika 7(1), 47–74 (1968).zbMATHMathSciNetGoogle Scholar
  2. 2.
    Yu. L. Ershov, “A Hierarchy of Sets. II”, Algebra i Logika 7(4), 15–47 (1968).zbMATHMathSciNetGoogle Scholar
  3. 3.
    Yu. L. Ershov, “A Hierarchy of Sets. III”, Algebra i Logika 9(1), 34–51 (1970).MathSciNetGoogle Scholar
  4. 4.
    M. M. Arslanov, The Ershov Hierarchy (Kazansk. Gos. Univ., Kazan, 2007) [in Russian].Google Scholar
  5. 5.
    M. M. Arslanov, “Structural Properties of the Degrees below 0′,” Izv. Vyssh. Uchebn. Zaved. Mat., No. 7, 27–33 (1988) [Soviet Mathmatics (Izv. VUZ) 32 (7), 25–31 (1988).Google Scholar
  6. 6.
    R. G. Downey, “D. R. E. Degrees and the Nondiamond Theorem,” Bull. Lond. Math. Soc. 21, 43–50 (1989).zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    A. H. Lachlan, “Lower Bounds for Pairs of Recursively Enumerable Degrees,” Proc. Lond. Math. Soc., III Ser. 16, 537–569 (1966).zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    S. B. Cooper, L. Harrington, A. H. Lachlan, S. Lempp, and R. I. Soare, “The D. R. E. Degrees Are Not Dense,” Ann. Pure Appl. Logic 55(2), 125–151 (1991).zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    G. E. Sacks, “The Recursively Enumerable Degrees Are Dense,” Ann. Math. 80(2), 300–312 (1964).CrossRefMathSciNetGoogle Scholar
  10. 10.
    M. Arslanov, S. B. Cooper, and A. Li, “There Is No Low Maximal D. C. E. Degree,” Math. Log. Q. 46(3), 409–416 (2000); corrigendum ibid. 50 (6), 628–636 (2004).zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    L. Welch, “A Hierarchy of Families of Recursively Enumerable Degrees and a Theorem of Founding Minimal Pairs,” Ph. D. Thesis (University of Illinois, Urbana, 1980).Google Scholar

Copyright information

© Allerton Press, Inc. 2010

Authors and Affiliations

  1. 1.Kazan State UniversityKazanRussia

Personalised recommendations