Skip to main content

On the structure of degrees below O′

  • 279 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 1432)

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.M. Arslanov, An hierarchy of degrees of unsolvability, Prob. Meth. Cyb. 18(1982), 10–17.

    MathSciNet  MATH  Google Scholar 

  2. M.M. Arslanov, Structural properties of the degrees below O′, Sov.Math.Dokl.,N.S. 283, 2(1985), 270–273.

    MathSciNet  MATH  Google Scholar 

  3. M.M. Arslanov, Recursively Enumerable Sets and Degrees of Unsolvability, Kazan Univ. Press, Kazan, USSR, 1986.

    MATH  Google Scholar 

  4. M.M. Arslanov, On the upper semilattice of Turing degrees below O′, Sov.Math. 7(1988), 27–33.

    MathSciNet  MATH  Google Scholar 

  5. S.B. Cooper, Degrees of Unsolvability, Ph.D.Thesis, Leicester University, Leicester, 1971.

    Google Scholar 

  6. S.B.Cooper, On a theorem of C.E.M.Yates, Handwritten notes, 1974.

    Google Scholar 

  7. S.B.Cooper, The density of the low2 n-r.e. degrees, to appear.

    Google Scholar 

  8. R.L. Epstein,R. Haas,R.L. Kramer, Hierarchies of sets and degrees below O′, Lect.Not.Math. 859(1981), 32–48.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. L.Harrington,A.H.Lachlan, S.Lempp,R.I.Soare, On the nondensity of the d-r.e.degrees, to appear.

    Google Scholar 

  10. C.G. Jockush,R.A. Shore, Pseudo-jump operators 11: Transfinite iteration, hierarchies and minimal covers, J.Symb.Log.49(1984), 1205–1236.

    CrossRef  MATH  Google Scholar 

  11. A.H. Lachlan, A recursively enumerable degree which will not split over all lesser ones, Ann.Math.Log. 9(1975), 307–365.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. R.M. Robinson, Jump restricted interpolation in the recursively enumerable degrees, Ann.Math. 93(1971), 586–596.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. G.E. Sacks, On the degrees less than O′, Ann.Math. 77(1963), 211–231.

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. R.I. Soare, Recursively Enumerable Sets and Degrees, Springer-Verlag, Berlin,New York,London, 1987.

    CrossRef  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Arslanov, M.M. (1990). On the structure of degrees below O′. In: Ambos-Spies, K., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0086111

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52772-5

  • Online ISBN: 978-3-540-47142-4

  • eBook Packages: Springer Book Archive