Skip to main content

The priority method for the construction of recursively enumerable sets

The Priority Method

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

Keywords

  • Density Theorem
  • Total Function
  • Minimal Pair
  • Priority Method
  • Recursive Sequence

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. D.A. Martin, The priority method of Sacks, mimeographed.

    Google Scholar 

  2. R.M. Friedberg, Two recursively enumerable sets of incomparable degrees of unsolvability, Proc. Nat. Acad. Sci. U.S.A. 43 (1957), 236–238.

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. _____, The priority method I, Zeitschr. f. math. Logik und Grundlagen Math. 13 (1967), 1–10.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. A.A. Mučnik, Negative answer to the problem of reducibility of the theory of algorithms (Russian), Dokl. Akad. Nank SSSR 108 (1956), 194–197.

    Google Scholar 

  6. _____, Solution of Post's reduction problem and of certain other problems in the theory of algorithms (Russian), Trudy Moskov. Mat. Obsc. 7 (1958), 391–405.

    MathSciNet  Google Scholar 

  7. J. Myhill, Review of [6], Math. Reviews #5570 22 (1967), 930.

    Google Scholar 

  8. G.E. Sacks, On the degrees less than 0′. Ann. of Math. 77 (1963), 211–231.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. _____, Degrees of Unsolvability, Ann. of Math. Studies 55, Princeton, 1963.

    Google Scholar 

  10. _____, The recursively enumerable degrees are dense, Ann. of Math. 80 (1964), 300–312.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. C.E.M. Yates, A minimal pair of recursively enumerable degrees, J. Symb. 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

Lachlan, A.H. (1973). The priority method for the construction of recursively enumerable sets. 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/BFb0066779

Download citation

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

  • 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