Skip to main content

Priority arguments using iterated trees of strategies

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

Abstract

A general framework for priority arguments in classical recursion theory, using iterated trees of strategies, is introduced and used to present new proofs of four fundamental theorems of recursion theory.

Keywords

  • Complexity Level
  • Minimal Pair
  • Recursion Theory
  • True Path
  • Infinite 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.

The authors would like to thank C. Ash, M. Groszek, J. Knight, A. Kučera, and T. Slaman for stimulating discussions and/or providing related preprints. The first author was partially supported by NSF grants DMS-8701891, DMS-8901529, a Binational NSF grant U.S.-West Germany, and post-doctoral fellowships of the Deutsche Forschungsgemeinschaft and the Mathematical Sciences Research Institute. The second author was partially supported by NSF grants DMS-8521843 and DMS-8900349 and by the Mathematical Sciences Research Institute.

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. C.J. Ash, Stability of recursive structures in arithmetical degrees, Ann. Pure Appl. Logic 32 (1986), 113–135.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. C.J. Ash, Labelling systems and r.e. structures, to appear.

    Google Scholar 

  3. R.M. Friedberg, Two recursively enumerable sets of incomparable degree of unsolvability, Proc. Natl. Acad. Sci. USA 43 (1957), 236–238.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. M.J. Groszek, T.A. Slaman, Foundations of the priority method I: Finite and infinite injury, preprint.

    Google Scholar 

  5. A. Kučera, An alternative priority-free solution to Post's problem, in: Twelfth Symposium held in Bratislava, August 25–29, 1986, edited by J. Gruska, B. Rovan, and J. Wiederman, Lecture Notes in Computer Science No. 233, Proceedings, Mathematical Foundations of Computer Science '86, Springer-Verlag, Berlin, 1986.

    Google Scholar 

  6. A. Kučera, On the use of diagonally nonrecursive functions, Logic Colloquium '87 (Granada, 1987), Studies in Logic and Foundations of Mathematics, 129, North-Holland, Amsterdam, 1989, 219–239.

    Google Scholar 

  7. A.H. Lachlan, On some games relevant to the theory of recursively enumerable sets, Ann. of Math. (2) 91 (1970), 291–310.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. A.H. Lachlan, The priority method for the construction of recursively enumerable sets, in, Lecture Notes in Mathematics No. 337, Springer-Verlag, Berlin, 1973, 311–344.

    CrossRef  Google Scholar 

  9. S. Lempp, M. Lerman, The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations, in preparation.

    Google Scholar 

  10. S. Lempp, M. Lerman, The decidability of the existential theory of the poset of the Turing degrees with jump and 0, in preparation.

    Google Scholar 

  11. M. Lerman, Admissible ordinals and priority arguments, in, Lecture Notes in Mathematics No. 337, Springer-Verlag, Berlin, 1973, 311–344.

    Google Scholar 

  12. A.R.D. Mathias, H. Rogers, Jr., Cambridge Summer School in Mathematical Logic (editors), held in Cambridge (England), August 1–21, 1971, Lecture Notes in Mathematics No. 337, Springer-Verlag, Berlin, 1973.

    Google Scholar 

  13. A.A. Muchnik, On the unsolvability of the problem of reducibility in the theory of algorithms, Dokl. Akad. Nauk SSSR, N.S. 108 (1956), 194–197.

    MathSciNet  MATH  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. G.E. Sacks, Recursive enumerability and the jump operator, Trans. Amer. Math. Soc. 108 (1963), 223–239.

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  18. R.I. Soare, The infinite injury priority method, J. Symbolic Logic 41 (1976), 513–530.

    CrossRef  MathSciNet  MATH  Google Scholar 

  19. R.I. Soare, Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Omega Series, Springer-Verlag, Berlin, 1987.

    CrossRef  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

Lempp, S., Lerman, M. (1990). Priority arguments using iterated trees of strategies. 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/BFb0086123

Download citation

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

  • 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