Skip to main content

Admissible ordinals and priority arguments

The Priority Method

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

Keywords

  • Lower Priority
  • Regular Cardinal
  • Minimal Pair
  • Closed Door
  • Priority Method

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. G. Driscoll, Contributions to metarecursion theory, Ph.D. Thesis, Cornell University, Ithaca, N.Y., 1965.

    Google Scholar 

  2. R. M. Friedberg, Three theorems on recursive enumeration, Journal of Symbolic Logic 23 (1958), 309–316.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. _____, Two recursively enumerable sets of incomparable degrees of unsolvability, Proceedings of the National Academy of Science, U.S.A., 43(1957), 236–238.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. C. Jockusch and R. I. Soare, A minimal pair of π o1 classes, Journal of Symbolic Logic 36(1971), 66–78.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. A. H. Lachlan, Lower bounds for pairs of recursively enumerable degrees, Proceedings of the London Mathematical Society (3) 16(1966), 537–569.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. _____, The priority method for the construction of recursively enumerable sets, These Proceedings.

    Google Scholar 

  7. M. Lerman, On suborderings of the α-recursively enumerable α-degrees, to appear.

    Google Scholar 

  8. _____ and G. E. Sacks, On minimal pairs of α-recursively enumerable α-degrees, to appear.

    Google Scholar 

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

    MATH  Google Scholar 

  10. G. E. Sacks, Post's problem, admissible ordinals, and regularity, Transactions of the American Mathematical Society 124(1966), 1–23.

    MathSciNet  MATH  Google Scholar 

  11. _____ and S. Simpson, The Friedberg Muchnik theorem in α-recursion theory, to appear.

    Google Scholar 

  12. C. E. M. Yates, A minimal pair of recursively enumerable degrees, Journal of Symbolis 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

© 1973 Springer-Verlag

About this paper

Cite this paper

Lerman, M. (1973). Admissible ordinals and priority arguments. In: Mathias, A.R.D., Rogers, H. (eds) Cambridge Summer School in Mathematical Logic. Lecture Notes in Mathematics, vol 337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066780

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-05569-3

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

  • eBook Packages: Springer Book Archive