Skip to main content
SpringerLink
Log in

The priority method for the construction of recursively enumerable sets

  • The Priority Method
  • Conference paper
  • First Online:
Cambridge Summer School in Mathematical Logic

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
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. 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.

    Article  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.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  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.

    Article  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.

    Article  MathSciNet  MATH  Google Scholar 

  11. C.E.M. Yates, A minimal pair of recursively enumerable degrees, J. Symb. Logic 31 (1966), 159–168.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Simon Fraser University, Burnaby 2, B.C., Canada

    A. H. Lachlan

Authors
  1. A. H. Lachlan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. R. D. Mathias H. Rogers

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

Publish with us

Policies and ethics

Search

Navigation