Skip to main content

Degrees with Almost Universal Cupping Property

  • Conference paper
Book cover Programs, Proofs, Processes (CiE 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6158))

Included in the following conference series:

Abstract

The notion of cupping/noncupping has played an essential role in the study of various degree structures in the Ershov hierarchy. As an approach to refute Shoenfield conjecture, Yates (see [2]) proved the existence of a nonzero noncuppable r.e. degree, a degree cupping no incomplete r.e. degree to 0’. In contrast to this, Arslanov proved in [1] that nonzero noncuppable degrees do not exist in the structure of d.r.e. degrees, which shows that the structures of r.e. degrees and d.r.e. degrees are not elementary equivalent.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arslanov, M.M.: Structural properties of the degrees below 0′. Dokl. Akad. Nauk SSSR(N. S.) 283, 270–273 (1985)

    MathSciNet  Google Scholar 

  2. Cooper, S.B.: On a theorem of C. E. M. Yates. Handwritten Notes (1974)

    Google Scholar 

  3. Cooper, S.B., Yi, X.: Isolated d.r.e. degrees. Preprint series, vol. 17, 25 p. University of Leeds, Dept. of Pure Math. (1995)

    Google Scholar 

  4. Cooper, S.B., Harrington, L., Lachlan, A.H., Lempp, S., Soare, R.I.: The d.r.e. degrees are not dense. Ann. Pure Appl. Logic 55, 125–151 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  5. Li, A., Song, Y., Wu, G.: Universal cupping degrees. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol. 3959, pp. 721–730. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Odifreddi, P.: Classical recursion theory. In: Studies in Logic and the Foundations of Mathematics, vol. 125. North-Holland, Amsterdam (1989)

    Google Scholar 

  7. Posner, D.: The upper semilattice of degree ≤ 0′ is complemented. J. Symbolic Logic 46, 705–713 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  8. Posner, D., Robinson, W.: Degrees joining to 0′. J. Symbolic Logic 46, 714–722 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  9. Slaman, T.A., Steel, J.R.: Complementation in the Turing degrees. Journal of Symbolic Logic 54, 160–176 (1989)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  11. Wu, G.: Jump operator and Yates degrees. Journal of Symbolic Logic 71, 252–264 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  12. Yates, C.E.M.: Recursively enumerable degrees and the degrees less than \(0\sp{(1)}\), Sets, Models and Recursion Theory. In: Proc. Summer School Math. Logic and Tenth Logic Colloq., Leicester, 1965, pp. 264–271. North-Holland, Amsterdam (1967)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, J., Wu, G. (2010). Degrees with Almost Universal Cupping Property. In: Ferreira, F., Löwe, B., Mayordomo, E., Mendes Gomes, L. (eds) Programs, Proofs, Processes. CiE 2010. Lecture Notes in Computer Science, vol 6158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13962-8_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13962-8_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13961-1

  • Online ISBN: 978-3-642-13962-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics