Skip to main content
Log in

Iterated trees and fragments of arithmetic

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Friedman, H.M., Simpson, S.G., Smith, R.L.: Countable algebra and set existence axioms. Ann. Pure Appl. Logic25, 141–181 (1983)

    Google Scholar 

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

  3. Kontostathis, K.: Priority theory. Preprint

  4. Kirby, L.A.S., Paris, J.B.: 112-1 schemas in arithmetic. Logic Colloquim'77, pp. 199–209. Amsterdam: North Holland 1978

    Google Scholar 

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

    Google Scholar 

  6. Lachlan, A.H.: The priority method for the construction of recursively enumerable sets. In: A. Mathias et al. (eds) Cambridge Summer School in Mathematical Logic, Cambridge (England), August 1971. Lect. Notes Math. 337, pp. 299–310. Berlin Heidelberg New York: Springer 1973

    Google Scholar 

  7. Lempp, S., Lerman, M.: Priority arguments using iterated trees of strategies. In: K. Ambos-Spies et al. (eds) Recursion theory week, Proc. Oberwolfach 1989. Lect. Notes Math. 1432, pp. 277–296. Berlin Heidelberg New York: Springer 1990

    Google Scholar 

  8. Mourad, J.: Ph.D thesis, University of Chicago (1989)

  9. Mytilinaios, M.E.: Finite injury and Σ1-induction. J. Sym. Logic54, 38–49 (1989)

    Google Scholar 

  10. Slaman, T.A., Woodin, W.H.: 112-3 and the finite injury priority method. Mathematical logic and its applications. Lect. Notes Math. 1388. Berlin Heidelberg New York: Springer 1989

    Google Scholar 

  11. Soare, R.I.: Recursively enumerable sets and degrees. Perspectives in mathematical logic. Omega Series. Berlin Heidelberg New York: Springer 1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

These results from a part of the author's doctoral thesis, Cornell University, 1992. The author wishes to thank his thesis advisor Prof. Richard Shore for his overall advice

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, Y. Iterated trees and fragments of arithmetic. Arch Math Logic 34, 97–112 (1995). https://doi.org/10.1007/BF01270390

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation