Advertisement

Archive for Mathematical Logic

, Volume 58, Issue 5–6, pp 711–751 | Cite as

A flexible type system for the small Veblen ordinal

  • Florian Ranzi
  • Thomas StrahmEmail author
Article
  • 15 Downloads

Abstract

We introduce and analyze two theories for typed (accessible part) inductive definitions and establish their proof-theoretic ordinal to be the small Veblen ordinal \(\vartheta \Omega ^\omega \). We investigate on the one hand the applicative theory \(\mathsf {FIT}\) of functions, (accessible part) inductive definitions, and types. It includes a simple type structure and is a natural generalization of S. Feferman’s system \(\mathrm {QL}(\mathsf {F}_\mathsf {0}\text {-}\mathsf {IR}_{N})\). On the other hand, we investigate the arithmetical theory \(\mathsf {TID}\) of typed (accessible part) inductive definitions, a natural subsystem of \(\mathsf {ID}_1\), and carry out a wellordering proof within \(\mathsf {TID}\) that makes use of fundamental sequences for ordinal notations in an ordinal notation system based on the finitary Veblen functions. The essential properties for describing the ordinal notation system are worked out.

Keywords

Proof theory Inductive definitions Applicative theories Small Veblen ordinal Finitary Veblen functions Metapredicativity Higher types Subsystems of second-order arithmetic 

Mathematics Subject Classification

03F03 03F15 03F35 03F50 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

References

  1. 1.
    Afshari, B., Rathjen, M.: A note on the theory of positive induction, \({{\rm ID}}^\ast _1\). Arch. Math. Logic 49, 275–281 (2010).  https://doi.org/10.1007/s00153-009-0168-9 MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Beeson, M.J.: Foundations of Constructive Mathematics: Metamathematical studies. Springer, Berlin (1985)CrossRefzbMATHGoogle Scholar
  3. 3.
    Buchholz, W., Feferman, S., Pohlers, W., Sieg, W.: Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies, volume 897 of Lecture Notes in Mathematics. Springer, Berlin (1981)Google Scholar
  4. 4.
    Bridge, J.: A simplification of the Bachmann method for generating large countable ordinals. J. Symb. Logic 40(2), 171–185 (1975)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Buchholz, W., Schütte, K.: Proof Theory of Impredicative Subsystems of Analysis, volume 2 of Studies in Proof Theory Monographs. Bibliopolis, Napoli (1988)zbMATHGoogle Scholar
  6. 6.
    Buchholz, W.: Prädikative Beweistheorie (Predicative proof theory). Lecture notes, University of Munich (2004–2005)Google Scholar
  7. 7.
    Buchholz, W.: A survey on ordinal notations around the Bachmann–Howard ordinal. In: Kahle, R., Strahm, T., Studer, T. (eds.) Advances in Proof Theory, pp. 1–29. Birkhaeuser, Springer, Basel (2016)Google Scholar
  8. 8.
    Cantini, A.: On the relation between choice and comprehension principles in second order arithmetic. J. Symb. Logic 51(2), 360–373 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Feferman, S.: Constructive theories of functions and classes. In: van Dalen, D., Boffa, M., Mcaloon, K. (eds.) Logic Colloquium ’78 Proceedings of the colloquium held in Mons, volume 97 of Studies in Logic and the Foundations of Mathematics, pp. 159–224. Elsevier (1979)Google Scholar
  10. 10.
    Feferman, S.: Logics for termination and correctness of functional programs, II. Logics of strength PRA. In: Aczel, P., Simmons, H., Wainer, S.S. (eds.) Proof Theory, pp. 195–225. Cambridge University Press, Cambridge (1992)Google Scholar
  11. 11.
    Feferman, S., Jäger, G., Strahm, T.: Foundations of Explicit Mathematics (in preparation) Google Scholar
  12. 12.
    Jäger, G.: Metapredicative and explicit Mahlo: a proof-theoretic perspective. In: Cori, R., Razborov, A., Todorcevic, S., Wood, C. (eds.) Proceedings of Logic Colloquium ’00, volume 19 of Association of Symbolic Logic Lecture Notes in Logic, pp. 272–293. AK Peters (2005)Google Scholar
  13. 13.
    Jäger, G., Kahle, R., Setzer, A., Strahm, T.: The proof-theoretic analysis of transfinitely iterated fixed point theories. J. Symb. Logic 64(1), 53–67 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Jäger, G., Strahm, T.: Bar induction and \(\omega \) model reflection. Ann. Pure Appl. Logic 97(1–3), 221–230 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Jäger, G., Strahm, T.: Reflections on reflections in explicit mathematics. Ann. Pure Appl. Logic 136(1–2), 116–133 (2005) (Festschrift on the occasion of Wolfram Pohlers’ 60th birthday) Google Scholar
  16. 16.
    Probst, D.: The proof-theoretic analysis of transfinitely iterated quasi least fixed points. J. Symb. Logic 71(3), 721–746 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Probst, D.: Modular Ordinal Analysis of Subsystems of Second-Order Arithmetic of Strength up to the Bachmann–Howard Ordinal. Habilitation, Universität Bern (2017)Google Scholar
  18. 18.
    Ranzi, F.: From a flexible type system to metapredicative wellordering proofs. PhD thesis, Universität Bern. http://www.iam.unibe.ch/ltgpub/2015/ran15.pdf (2015).  https://doi.org/10.7892/boris.75102
  19. 19.
    Rathjen, M.: Fragments of Kripke–Platek set theory with infinity. In: Aczel, P., Simmons, H., Wainer, S.S. (eds.) Proof Theory. A Selection of Papers from the Leeds Proof Theory Programme 1990, pp. 251–273. Cambridge University Press, Cambridge (1992)Google Scholar
  20. 20.
    Rathjen, M., Weiermann, A.: Proof-theoretic investigations on Kruskal’s theorem. Ann. Pure Appl. Logic 60, 49–88 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Schütte, K.: Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen. Math. Ann. 127, 15–32 (1954).  https://doi.org/10.1007/BF01361109 MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Schütte, K.: Beziehungen des Ordinalzahlensystems \({{\rm OT}}(\vartheta )\) zur Veblen-Hierarchie. Unpublished notes (1992)Google Scholar
  23. 23.
    Simpson, S.G.: Subsystems of Second Order Arithmetic, 2nd edn. Cambridge University Press, Cambridge (2009) (Cambridge Books Online) Google Scholar
  24. 24.
    Strahm, T.: First steps into metapredicativity in explicit mathematics. In: Barry Cooper, S., Truss, J.K. (eds.) Sets and Proofs, volume 258 of London Mathematical Society Lecture Notes, pp. 383–402. Cambridge University Press, Cambridge (1999)Google Scholar
  25. 25.
    Van der Meeren, J., Rathjen, M., Weiermann, A.: An order-theoretic characterization of the Howard–Bachmann-hierarchy. Arch. Math. Logic 56(1–2), 79–118 (2017)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Institut für InformatikUniversität BernBernSwitzerland

Personalised recommendations