Skip to main content

Minimal degrees and 1-generic sets below 0′

  • Conference paper
  • First Online:
Computation and Proof Theory

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

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 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
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. C.T. CHONG, "Generic sets and minimal covers", preprint.

    Google Scholar 

  2. R.M. FRIEDBERG, "A criterion for completeness of degrees of unsolvability", J. Symbolic Logic 22 (1957), 159–160.

    Article  MathSciNet  MATH  Google Scholar 

  3. C.G. JOCKUSCH, Jr., "Simple proofs of some theorems on high degrees of unsolvability", Canad. J. Math. 29 (1977), 1072–1080.

    Article  MathSciNet  MATH  Google Scholar 

  4. C.G. JOCKUSCH, Jr., "Degrees of generic sets", in Recursion Theory: Its Generalisations and Applications, (F.R. Drake and S.S. Wainer, eds.), Cambridge University Press, Cambridge, 1980.

    Google Scholar 

  5. C.G. JOCKUSCH, Jr. and D.B. POSNER, "Automorphism bases for degrees of unsolvability", Israel J. Math. 40 (1981), 150–164.

    Article  MathSciNet  MATH  Google Scholar 

  6. C.G. JOCKUSCH, Jr. and D.B. POSNER, "Double jumps of minimal degrees", J. Symbolic Logic 43 (1978), 715–724.

    Article  MathSciNet  MATH  Google Scholar 

  7. M. LERMAN, Degrees of Unsolvability, Springer Verlag, 1983.

    Google Scholar 

  8. D.A. MARTIN, "Measure, category and degrees of unsolvability", unpublished preprint, 1967.

    Google Scholar 

  9. D.B. POSNER, High Degrees, Doctoral Dissertation, University of California, Berkeley, 1977.

    Google Scholar 

  10. D.B. POSNER and R.W. ROBINSON, "Degrees joining to 0′," J. Symbolic Logic 46 (1981), 714–722.

    Article  MathSciNet  MATH  Google Scholar 

  11. C.E.M. YATES, "Density and incomparability in the degrees less than 0(1)" (abstract), J. Symbolic Logic 31 (1966), 301.

    MathSciNet  Google Scholar 

  12. C.E.M. YATES, "Banach-Mazur games, comeager sets, and degrees of unsolvability", Math. Proc. Camb. Phil. Soc. 79 (1976), 195–220.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Egon Börger Walter Oberschelp Michael M. Richter Brigitta Schinzel Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Chong, C.T., Jockusch, C.G. (1984). Minimal degrees and 1-generic sets below 0′. In: Börger, E., Oberschelp, W., Richter, M.M., Schinzel, B., Thomas, W. (eds) Computation and Proof Theory. Lecture Notes in Mathematics, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0099479

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13901-0

  • Online ISBN: 978-3-540-39119-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics