Skip to main content
Log in

Bounded low and high sets

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

Abstract

Anderson and Csima (Notre Dame J Form Log 55(2):245–264, 2014) defined a jump operator, the bounded jump, with respect to bounded Turing (or weak truth table) reducibility. They showed that the bounded jump is closely related to the Ershov hierarchy and that it satisfies an analogue of Shoenfield jump inversion. We show that there are high bounded low sets and low bounded high sets. Thus, the information coded in the bounded jump is quite different from that of the standard jump. We also consider whether the analogue of the Jump Theorem holds for the bounded jump: do we have \(A \le _{bT}B\) if and only if \(A^b \le _1 B^b\)? We show the forward direction holds but not the reverse.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Anderson, B., Csima, B.: A bounded jump for the bounded Turing degrees. Notre Dame J. Form. Log. 55(2), 245–264 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  2. Anderson, B.A.: Automorphisms of the truth-table degrees are fixed on a cone. J. Symb. Log. 74(2), 679–688 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ash, C.J., Knight, J.: Computable Structures and the Hyperarithmetical Hierarchy, volume 144 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam (2000)

    MATH  Google Scholar 

  4. Cooper, B.: Computability Theory. Chapman and Hall/CRC, Boca Raton (2004)

    MATH  Google Scholar 

  5. Csima, B., Downey, R., Ng, K.M.: Limits on jump inversion for strong reducibilities. J. Symb. Log. 76(4), 1287–1296 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Downey, R., Greenberg, N.: A transfinite hierarchy of notions of lowness in the computably enumerable degrees, unifying classes, and natural definability. Preprint

  7. Gerla, G.: Una generalizzazione della gerarchia di Ershov. Bolletino U.M.I 16–B(5), 765–778 (1979)

    MATH  Google Scholar 

  8. Jockusch Jr., C.G., Shore, R.A.: Pseudo-jump operators II: transfinite iterations, hierarchies, and minimal covers. J. Symb. Log. 49, 1205–1236 (1984)

    Article  MATH  Google Scholar 

  9. Mohrherr, J.: Density of a final segment of the truth-table degrees. Pac. J. Math. 115(2), 409–419 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  10. Mohrherr, J.: A refinement of low \(n\) and high \(n\) for the r.e. degrees. Z. Math. Logik Grundlag. Math. 32(1), 5–12 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  11. Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987)

    Book  MATH  Google Scholar 

  12. Soare, R.I.: Computability Theory and Applications. Springer, Berlin (2016)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Karen M. Lange.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Anderson, B.A., Csima, B.F. & Lange, K.M. Bounded low and high sets. Arch. Math. Logic 56, 507–521 (2017). https://doi.org/10.1007/s00153-017-0537-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-017-0537-8

Keywords

Mathematics Subject Classification

Navigation