Skip to main content

Three easy constructions of recursively enumerable sets

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

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.

References

  1. J. C. E. Dekker, A theorem on hypersimple sets, Proc. Amer. Math. Soc. 5(1954), 791–796.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. J. C. E. Dekker and J. Myhill, Retraceable sets, Canadian J. Math. 10(1958), 357–373.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. L. Harrington, Plus-cupping in the r.e. degrees, unpublished manuscript.

    Google Scholar 

  4. A. H. Lachlan, Lower bounds for pairs of recursively enumerable degrees, Proc. London Math. Soc. 16(1966), 537–569.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. R. Ladner and L. Sasso, The weak truth table degrees of recursively enumerable sets, Annals of Math. Logic 8(1975), 429–448.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. P. G. Odifreddi, Strong reducibilities, to appear in Bull. Amer. Math. Soc.

    Google Scholar 

  7. E. L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc. 50(1944), 284–316.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.

    MATH  Google Scholar 

  9. G. E. Sacks, Degrees of unsolvability, Annals of Math. Studies 55, 1966.

    Google Scholar 

  10. R. I. Soare, The infinite injury priority method, J. Symbolic Logic 41(1976), 513–530.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. L. Welch, A hierarchy of families of recursively enumerable degrees and a theorem on bounding minimal pairs, Doctoral Dissertation, University of Illinois, 1980.

    Google Scholar 

  12. C. E. M. Yates, Three theorems on the degrees of recursively enumerable sets, Duke Math. J. 32(1965), 461–468.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. C. E. M. Yates, A minimal pair of recursively enumerable degrees, J. Symbolic Logic 31(1966), 159–168.

    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

Jockusch, C.G. (1981). Three easy constructions of recursively enumerable sets. 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/BFb0090941

Download citation

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

  • 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