Skip to main content
Log in

Incomparability in local structures of s-degrees and Q-degrees

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

We show that for every intermediate \(\Sigma ^0_2\) s-degree (i.e. a nonzero s-degree strictly below the s-degree of the complement of the halting set) there exists an incomparable \(\Pi ^0_1\) s-degree. (The same proof yields a similar result for other positive reducibilities as well, including enumeration reducibility.) As a consequence, for every intermediate \(\Pi ^0_2\) Q-degree (i.e. a nonzero Q-degree strictly below the Q-degree of the halting set) there exists an incomparable \(\Sigma ^0_1\) Q-degree. We also show how these results can be applied to provide proofs or new proofs (essentially already known, although some of them not explicitly noted in the literature) of upper density results in local structures of s-degrees and Q-degrees.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Arslanov, M.M., Batyrshin, I.I., Omanadze, R.S.: Structural properties of Q-degrees of n-c.e. sets. Ann. Pure Appl. Logic 156, 13–20 (2008)

    Article  MathSciNet  Google Scholar 

  2. Chitaia, I., Ng, K.M., Sorbi, A., Yang, Y.: Minimal degrees and downwards density in some strong s-reducibilities and Q-reducibilities (submitted)

  3. Downey, R.G., Laforte, G., Nies, A.: Computably enumerable sets and quasi-reducibility. Ann. Pure Appl. Logic 95, 1–35 (1998)

    Article  MathSciNet  Google Scholar 

  4. Friedberg, R.M., Rogers Jr., H.: Reducibility and completeness for sets of integers. Z. Math. Logik Grundlag. Math. 5, 117–125 (1959)

    Article  MathSciNet  Google Scholar 

  5. McEvoy, K., Cooper, S.B.: On minimal pairs of enumeration degrees. J. Symb. Logic 50, 983–1001 (1985)

    Article  MathSciNet  Google Scholar 

  6. Omanadze, RSh: Quasi-degrees of recursively enumerable sets. In: Cooper, S.B., Goncharov, S. (eds.) Computability and Models: Perspectives East and West. Kluwer Academic, New York (2002)

    Google Scholar 

  7. Omanadze, R.S., Sorbi, A.: Strong enumeration reducibilities. Arch. Math. Logic 45(7), 869–912 (2006)

    Article  MathSciNet  Google Scholar 

  8. Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)

    MATH  Google Scholar 

  9. Soare, R.I.: Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic, Omega Series. Springer, Heidelberg (1987)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andrea Sorbi.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Chitaia’s work was supported by Shota Rustaveli National Science Foundation of Georgia (SRNSFG) (Grant number: YS-18-168). Ng was partially supported by the Grants MOE-RG131/17 and MOE2015-T2-2-055. Sorbi was partially supported by PRIN 2017 Grant “Mathematical Logic: models, sets, computability”. Sorbi is a member of INDAM-GNSAGA. Yang’s research was partially supported by NUS Grant R-146-000-231-114.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chitaia, I., Ng, K.M., Sorbi, A. et al. Incomparability in local structures of s-degrees and Q-degrees. Arch. Math. Logic 59, 777–791 (2020). https://doi.org/10.1007/s00153-020-00714-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-020-00714-x

Keywords

Mathematics Subject Classification

Navigation