Skip to main content

Genericity for recursively enumerable sets

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

Keywords

  • Primitive Recursive Function
  • Enumerable Degree
  • Previous Substage
  • Recursive Enumeration
  • Simple Degree

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   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.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. K. Ambos-Spies, On the structure of the recursively enumerable degrees, Dissertation, University of Munich, 1980.

    Google Scholar 

  2. K. Ambos-Spies, C. Jockusch, R. A. Shore, and R. I. Soare, An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees, Trans. Amer. Math. Soc. 281 (1984), 109–128.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. K. Ambos-Spies, On pairs of recursively enumerable degrees, Trans. Amer. Math. Soc. 283 (1984), 507–531.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. K. Ambos-Spies, Cupping and noncapping in the r.e. weak truth table and Turing degrees, Archiv für Math. Logik und Grundlagen der Math., to appear.

    Google Scholar 

  5. M. Bickford and C. F. Mills, Lowness properties of r.e. sets, to appear

    Google Scholar 

  6. R. Epstein, Degrees of unsolvability: Structure and theory, Lecture Notes in Mathematics. vol. 759. Springer Verlag, Berlin, Heidelberg, New York (1980).

    Google Scholar 

  7. M. Ingrassia, P-genericity for recursively enumerable sets, Doctoral Dissertation, University of Illinois at Urbana-Champaign, 1981

    Google Scholar 

  8. M. Ingrassia, P-generic r.e. degrees are dense, to appear

    Google Scholar 

  9. C. Jockusch, Degrees of generic sets, in Recursion Theory, its Generalisations and Applications, ed. by F. R. Drake and S. S. Wainer, Cambridge University Press, Cambridge (1980), 110–139.

    CrossRef  Google Scholar 

  10. C. Jockusch and D. Posner, Double jumps of minimal degrees, J. Symbolic Logic 43 (1978), 715–724.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. C. Jockusch, Three easy constructions of recursively enumerable sets, in Logic Year 1979–80 (Lecture Notes in Mathematics, 859) ed. by M. Lerman, J. H. Schmerl, and R. I. Soare, Springer Verlag, Berlin, Heidelberg, New York (1981), 83–91.

    Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. W. Maass, R. A. Shore, and M. Stob, Splitting properties and jump classes, Israel J. Math 39 (1981), 210–224.

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. W. Maass, Recursively enumerable generic sets, J. Symbolic Logic 47 (1982), 809–823.

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. W. Maass, Variations on promptly simple sets, to appear in J. Symbolic Logic.

    Google Scholar 

  16. J. Mohrherr, A refinement of lown and highn for the r.e. degrees, Z. Math. Logik und Grundlagen Math., to appear.

    Google Scholar 

  17. H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.

    MATH  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  19. R. I. Soare, Fundamental methods for constructing recursively enumerable degrees, in Recursion Theory: Its Generalisations and Applications, Ed. by F. R. Drake and S. S. Wainer, Cambridge University Press, Cambridge (1980).

    Google Scholar 

  20. R. I. Soare, Recursively enumerable sets and degrees: the study of computable functions and computably generated sets, Springer Verlag, Berlin, Heidelberg, New York, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Additional information

Dedicated to the fond memory of Bill Boone

Rights and permissions

Reprints and Permissions

Copyright information

© 1985 Springer-Verlag

About this paper

Cite this paper

Jockusch, C.G. (1985). Genericity for recursively enumerable sets. In: Ebbinghaus, HD., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0076222

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15673-4

  • Online ISBN: 978-3-540-39596-6

  • eBook Packages: Springer Book Archive