Skip to main content

Part of the book series: Logic in Asia: Studia Logica Library ((LIAA))

  • 197 Accesses

Abstract

In this chapter we analyze impredicative theories proof-theoretically. To extract computational (or countable) contents we employ a technique, collapsings, by which uncountable infinitary derivations and uncountable ordinals are collapsed down to countable ones. This is done through Mostowski collapsings of Skolem hulls as in the Condensation lemma, which is a key to prove the fact that the GCH (Generalized Continuum Hypothesis) holds in the constructible universe L.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Arai, T.: A consistency proof of a system including Feferman’s \({ ID}_{\xi }\) by Takeuti’s reduction method. Tsukuba J. Math. 11, 227–239 (1987)

    Article  Google Scholar 

  2. Arai, T.: A sneak preview of proof theory of ordinals. Ann. Japan Assoc. Phil. Sci. 20, 29–47 (2012)

    Google Scholar 

  3. Arai, T.: Conservation of first-order reflections. J. Symb. Logic 79, 814–825 (2014)

    Article  Google Scholar 

  4. Arai, T.: Proof-theoretic strengths of weak theories for positive inductive definitions. J. Symb. Logic 83, 1091–1111 (2018)

    Article  Google Scholar 

  5. Buchholz, W.: Normalfunktionen und konstruktive Systeme von Ordinalzahlen. In: Diller, J., Müller, G. H. (eds.) Proof Theory Symposion Keil 1974. Lecture Notes in Mathematics, vol. 500, pp. 4–25. Springer, Berlin (1975)

    Google Scholar 

  6. Buchholz, W.: Eine Erweiterung der Schnitteliminationsmethode. Habilitattionsschrift, München (1977)

    Google Scholar 

  7. Buchholz, W.: A new system of proof-theoretic ordinal functions. Ann. Pure Appl. Logic 32, 195–208 (1986)

    Article  Google Scholar 

  8. Buchholz, W.: A simplified version of local predicativity. In: Aczel, P.H.G., Simmons, H., Wainer, S.S. (eds.) Proof Theory, pp. 115–147. Cambridge University Press, Cambridge (1992)

    Google Scholar 

  9. Buchholz, W.: Explaining the Gentzen-Takeuti reduction steps: a second-order system. Arch. Math. Logic 40, 255–272 (2001)

    Article  Google Scholar 

  10. Buchholz, W., Feferman, S. Sieg, W., Pohlers, W.: Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies. Lecture Notes in Mathematics, vol. 897. Springer, Berlin (1981)

    Google Scholar 

  11. Cantini, A.: On the relationship between choice and comprehension principles in second order arithmetic. J. Symb. Logic 52, 360–373 (1986)

    Article  Google Scholar 

  12. Feferman, S.: Formal theories for transfinite iteration of generalized inductive definitions and some subsystems of analysis. In: Kino, A., Myhill, J., Vesley, R.E. (eds.), Intuitionism and Proof Theory, Proceedings of the Summer Conference at Buffalo, N. Y., 1968, pp. 303–325. North-Holland (1970)

    Google Scholar 

  13. Feferman, S.: Theories of finite type related to mathematical practice. In: Barwise, J. (ed.), Handbook of Mathematical Logic, pp. 913–971. North-Holland (1977)

    Google Scholar 

  14. Feferman, S.: The proof theory of classical and constructive inductive definitions. A forty years saga, 1968–2008. In: Schindler, R. (ed.), Ways of Proof Theory. Ontos Mathematical Logic, vol. 2, pp. 7–30. Ontos Verlag (2010)

    Google Scholar 

  15. Fujimoto, K.: Truths, inductive definitions, and Kripke-Platek systems over set theories. J. Symb. Logic 83, 868–898 (2018)

    Article  Google Scholar 

  16. Friedman, H.: Iterated inductive definitions and \(\Sigma ^{1}_{2}\text{-AC}\). In: Kino, A., Myhill, J., Vesley, R.E., (eds.), Intuitionism and Proof Theory, Proceedings of the Summer Conference at Buffalo, N. Y., 1968, pp. 435–442. North-Holland (1970)

    Google Scholar 

  17. Howard, W.A., Kreisel, G.: Transfinite induction and bar induction of type zero and one, and the role of continuity in intuitionistic analysis. J. Symb. Logic 31, 325–358 (1966)

    Article  Google Scholar 

  18. Jäger, G.: Zur Beweistheorie der Kripke-Platek Mengenlehre über den natürlichen Zahlen. Arch. Math. Logik Grundl. 22, 121–139 (1982)

    Article  Google Scholar 

  19. Jäger, G.: Fixed points in Peano arithmetic with ordinals. Ann. Pure Appl. Logic 60, 119–132 (1993)

    Article  Google Scholar 

  20. Kreisel, G., et. al.: Seminar on the Foundations of Analysis. (Mimeographed) Stanford (1963)

    Google Scholar 

  21. Moschovakis, Y.N.: Elementary Induction on Abstract Structures. North-Holland, Amsterdam (1974). reprinted from Dover Publications (2008)

    Google Scholar 

  22. Pohlers, W.: Cut-elimination for impredicative infinitary systems part I. Ordinal-analysis for \({\sf ID}_{1}\). Arch. Math. Logik Grundl. 21, 113–129 (1981)

    Google Scholar 

  23. Pohlers, W.: A short course in ordinal analysis. In: Aczel, P.H.G., Simmons, H., Wainer, S.S. (eds.), Proof Theory, pp. 27–78. Cambridge University Press, Cambridge (1992)

    Google Scholar 

  24. Rathjen, M.: Fragments of Kripke-Platek set theory with Infinity. In: Aczel, P.H.G., Simmons, H., Wainer, S.S., (eds.), Proof Theory, pp. 253–273. Cambridge University Press, Cambridge (1992)

    Google Scholar 

  25. Rathjen, M.: How to develop proof-theoretic ordinal functions on the basis of admissible ordinals. Math. Logic Quart. 39, 47–54 (1993)

    Article  Google Scholar 

  26. Rathjen, M.: The realm of ordinal analysis, In: Cooper, S.B., Truss, J.K., (eds.), Sets and Proofs. London Mathematical Society Lecture Notes, vol. 258, pp. 219–279. Cambridge University Press, Cambridge (1999)

    Google Scholar 

  27. Rathjen, M.: The art of ordinal analysis, In: International Congress of Mathematicians, vol. II, pp. 45–69. European Mathematical Society, Zürich (2006)

    Google Scholar 

  28. Rathjen, M.: Investigations of subsystems of second order arithmetic and set theory in strength between \(\Pi ^{1}_{1}\text{-CA }\) and \(\Delta ^{1}_{2}\text{-CA+BI }\): Part I. In: Schindler, R. (ed.), Ways of Proof Theory. Ontos Mathematical Logic, vol. 2, pp. 363–440. Ontos Verlag (2010)

    Google Scholar 

  29. Rathjen, M.: Relativized ordinal analysis: the case of power Kripke-Platek set theory. Ann. Pure Appl. Logic 165, 316–339 (2014)

    Article  Google Scholar 

  30. Rathjen, M., Weiermann, A.: Proof-theoretic investigations on Kruskal’s theorem. Ann. Pure Appl. Logic 60, 49–88 (1993)

    Article  Google Scholar 

  31. Sato, K.: Full and hat inductive definitions are equivalent in NBG. Arch. Math. Logic 54, 75–112 (2015)

    Article  Google Scholar 

  32. Sato, K.: A new model construction by making a detour via intuitionistic theories IV: a closer connection between \({\rm KP}\omega \) and BI. submitted

    Google Scholar 

  33. Takeuti, G.: Ordinal diagrams. J. Math. Soc. Jpn. 9, 386–394 (1957)

    Article  Google Scholar 

  34. Takeuti, G.: On the fundamental conjecture of GLC V. J. Math. Soc. Jpn. 10, 121–134 (1958)

    Article  Google Scholar 

  35. Takeuti, G.: On the fundamental conjecture of GLC VI. Proc. Jpn. Acad. 37, 440–443 (1961)

    Article  Google Scholar 

  36. Takeuti, G.: On the inductive definition with quantifiers of second order. J. Math. Soc. Jpn. 13, 333–341 (1961)

    Article  Google Scholar 

  37. Takeuti, G.: Proof Theory, 2nd edn. North-Holland, Amsterdam (1987). reprinted from Dover Publications (2013)

    Google Scholar 

  38. Tapp, C.: Eine direkte Einbettung von \({\sf KP}\omega \) in \({\sf ID}_{1}\). Diploma thesis, Westfälische Wilhelms-Universität Münster (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Toshiyasu Arai .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Arai, T. (2020). Collapsings. In: Ordinal Analysis with an Introduction to Proof Theory. Logic in Asia: Studia Logica Library. Springer, Singapore. https://doi.org/10.1007/978-981-15-6459-8_6

Download citation

Publish with us

Policies and ethics