Skip to main content

Hierarchies of sets and degrees below 0′

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

Keywords

  • Boolean Algebra
  • Minimal Degree
  • Recursive Function
  • Recursive Approximation
  • Canonical Classis

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
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.

Bibliography

  1. Addison, J., The method of alternating chains, in Theory of Models, North-Holland, Amsterdam, 1965 (p. 1–16).

    Google Scholar 

  2. Cooper, S. B., Doctoral Dissertation, University of Leicester, 1971.

    Google Scholar 

  3. Epstein, Richard L., Minimal Degrees of Unsolvability and the Full Approximation Construction, Memiors of the A.M.S., no. 162, 1975.

    Google Scholar 

  4. Epstein, Richard L., Degrees of Unsolvability: Structure and Theory, Lecture Notes in Mathematics no. 759, Springer-Verlag, New York.

    Google Scholar 

  5. Epstein, Richard L., Initial Segments of Degrees ≤ 0′, to appear.

    Google Scholar 

  6. Ershov, A. Hierarchy of Sets I, II, III, Algebra and Logic, vol. 7, no. 1, no. 4 (1968) and vol. 9, no. 1 (1970). (English translation, Consultants Bureau, N.Y.).

    Google Scholar 

  7. Gold, Limiting recursion, Journal of Symbolic Logic, vol. 30, no. 1, p. 28–48, 1965.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Putnam, H., Trial and error predicates and the solution to a problem of Mostowski, Journal of Symbolic Logic, vol. 30, no. 1, p. 49–57, 1965.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Rogers, Hartley, Theory of Recursive Functions and Effective Computation, McGraw-Hill, New York.

    Google Scholar 

  10. Sacks, Gerald, Degrees of Unsolvability, Annals of Math. Studies, no. 55, Princeton, New Jersey, revised edition, 1965.

    Google Scholar 

  11. Shoenfield, J. R., On the degrees of unsolvability, Annals of Mathematics, vol. 69, p. 644–653, 1959.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Soare, Robert, Recursively enumerable sets and degrees, Bull. A.M.S., vol. 84, no. 6 (1978), p. 1149.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Epstein, R.L., Haas, R., Kramer, R.L. (1981). Hierarchies of sets and degrees below 0′. In: Lerman, M., Schmerl, J.H., Soare, R.I. (eds) Logic Year 1979–80. Lecture Notes in Mathematics, vol 859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0090937

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10708-8

  • Online ISBN: 978-3-540-38673-5

  • eBook Packages: Springer Book Archive