Skip to main content
Springer Nature Link
Log in

There is no plus-capping degree

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

Summary

Answering a question of Per Lindström, we show that there is no “plus-capping” degree, i.e. that for any incomplete r.e. degreew, there is an incomplete r.e. degreea>w such that there is no r.e. degreev>w witha∩v=w.

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
$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.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  1. Downey, R.G., Stob, M.: Minimal pairs in lower cones. In preparation

  2. Feferman, S.: Arithmetization of metamathematics in a general setting. Fund. Math.49, 35–92 (1960)

    Google Scholar 

  3. Fejer, P.A., Soare, R.I.: The plus-cupping theorem for recursively enumerable degrees, Logic Year 1979–80: University of Connecticut. In: Lerman, M., Schmerl, H., Soare, R.I. (eds.) Lect. Notes Math., vol. 859, pp. 49–62. Berlin: Springer 1981

    Google Scholar 

  4. Lindström, P.: Some results on interpretability. Proceedings of the 5th Scandinavian Logic Symposium 1979, Aalborg, pp. 329–361 (1979)

  5. Lindström, P.: On certain lattices of degrees of interpretability. Notre Dame J. Formal Log.25, 127–140 (1984)

    Google Scholar 

  6. Shoenfield, J.R.: Non-bounding constructions. Ann. Pure Appl. Logic50, 191–205 (1990)

    Google Scholar 

  7. Soare, R.I.: Recursively enumerable sets and degrees. Perspectives in Mathematical Logic, Omega Series. Berlin: Springer 1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Victoria University of Wellington, P.O. Box 600, Wellington, New Zealand

    Rodney G. Downey & Steffen Lempp

  2. Department of Mathematics, University of Wisconsin, 53706, Madison, WI, USA

    Rodney G. Downey & Steffen Lempp

Authors
  1. Rodney G. Downey
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Steffen Lempp
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Mathematics subject classification: 03D30

The authors would like to thank Per Lindström for raising the question and Carl Jockusch for communicating it to them. The first author was partially supported by a U.S./New Zealand binational grant. The second author was partially supported by NSF grant DMS-9100114 and the U.S./New Zealand binational NSF grant INT-9020558

Rights and permissions

Reprints and permissions

About this article

Cite this article

Downey, R.G., Lempp, S. There is no plus-capping degree. Arch Math Logic 33, 109–119 (1994). https://doi.org/10.1007/BF01352932

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01352932

Keywords