Skip to main content

Notes on the O‴ priority method with special attention to density results

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

Keywords

  • Basic Module
  • Density Theorem
  • Tree Path
  • Recursion Theory
  • True Path

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   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. Ambos-Spies K., On pairs of recursively enumerable degrees Trans. Amer. Math. Soc. 283 (1984) 507–531.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Downey, R. G., A contiguous nonbranching degree, Z. Math. Logik. Grundlagen Math 35 (1989) 375–383.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. _____, Lattice nonembeddings and initial segments of the r.e. degrees. Annals Pure and Aplied Logic (to appear)

    Google Scholar 

  4. _____, and J Mourad, Superbranching degrees, these proceedings

    Google Scholar 

  5. _____, and T Slaman, Completely mitotic r.e. degrees, Annals Pure and Appl. Logic 41 (1989) 119–152.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. _____, and T Slaman, On co-simple isols and their intersection types, in preparation.

    Google Scholar 

  7. Fejer, P., The Structure of Definable Subclasses of the Recursively Enumerable Degrees, Ph. D. Diss., Univ. of Chicago, 1980.

    Google Scholar 

  8. _____, The density of the nonbranching degrees, Annals Pure and Appl. Logic 24 (1983) 113–130.

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. _____, Bounding minimal pairs, J. Symb. Logic 44 (1979) 626–642.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. _____, Decomposition of recursively enumerable degrees, Proc. Amer. Math. Soc. 79 (1980) 629–634.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Sacks, G. E., The recursively enumerable degrees are dense, Ann. of Math 80 (1964) 300–312.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. Shore, R. A., A non-inversion theorem for the jump operator, Ann. Pure and Appl. Logic 40 (1988) 277–303.

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. Slaman, T. A., The recursively enumerable branching degrees are dense in the recursively enumerable degrees, handwritten notes, University of Chicago, 1981.

    Google Scholar 

  15. Soare, R. I., Tree arguments in recursion theory and the 0‴ priority method, in Recursion Theory (ed. A. Nerode and R. Shore) A.M.S. publ. Providence, Rhode Island (1985) 53–106.

    CrossRef  Google Scholar 

  16. _____, Recursively Enumerable Sets and Degrees, Springer-Verlag, New York (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

Downey, R. (1990). Notes on the O‴ priority method with special attention to density results. 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/BFb0086115

Download citation

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

  • 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