Hypersimplicity and semicomputability in the weak truth table degrees | Archive for Mathematical Logic
Skip to main content
Springer Nature Link
Log in

Hypersimplicity and semicomputability in the weak truth table degrees

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

Abstract

We study the classes of hypersimple and semicomputable sets as well as their intersection in the weak truth table degrees. We construct degrees that are not bounded by hypersimple degrees outside any non-trivial upper cone of Turing degrees and show that the hypersimple-free c.e. wtt degrees are downwards dense in the c.e. wtt degrees. We also show that there is no maximal (w.r.t. ≤wtt) hypersimple wtt degree. Moreover, we consider the sets that are both hypersimple and semicomputable, characterize them as the (bi-infinite) c.e. cuts of computable orderings of ℕ of order type ω+ω* and study their wtt degrees. We show that there are hypersimple degrees that are not bounded by any hypersimple semicomputable degree, investigate relationships with the join and look for maximal and minimal elements of related classes.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /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 includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barmpalias, G.: The approximation structure of a computably approximable real. J. Symbolic Logic 68 (3), 885–922 (2003)

    Article  Google Scholar 

  2. Barmpalias, G.: Approximation Representations for Δ2 Reals, Archive for Mathematical Logic 43 (8), 947–964 (2004)

  3. Barmpalias, G.: Approximation Representations for Reals and their wtt-Degrees. Mathematical Logic Quarterly 50 (4/5), 370–380 (2004)

  4. Jockusch, C.: Semirecursive sets and positive reducibility. Trans. Am. Math. Soc. 131, 420–436 (1968)

    Google Scholar 

  5. Odifreddi, P.: Classical recursion theory. Amsterdam Oxford: North-Holland, 1989

  6. Odifreddi, P.: Classical recursion theory Vol. II. Amsterdam Oxford: North-Holland, 1999

  7. Soare, R.I.: Recursively enumerable sets and degrees. Berlin London: Springer-Verlag, 1987

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, University of Leeds, Leeds, LS2 9JT, United Kingdom

    George Barmpalias

Authors
  1. George Barmpalias
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to George Barmpalias.

Additional information

I wish to thank the anonymous referee for making helpful remarks that have improved the presentation of this work.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Barmpalias, G. Hypersimplicity and semicomputability in the weak truth table degrees. Arch. Math. Logic 44, 1045–1065 (2005). https://doi.org/10.1007/s00153-005-0288-9

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-005-0288-9

Key words or phrases

Search

Navigation