Advertisement

Ordinal analyses for monotone and cofinal transfinite inductions

  • Kentaro SatoEmail author
Article
  • 3 Downloads

Abstract

We consider two variants of transfinite induction, one with monotonicity assumption on the predicate and one with the induction hypothesis only for cofinally many below. The latter can be seen as a transfinite analogue of the successor induction, while the usual transfinite induction is that of cumulative induction. We calculate the supremum of ordinals along which these schemata for \(\varDelta _0\) formulae are provable in \(\mathbf {I}\varvec{\Sigma }_n\). It is shown to be larger than the proof-theoretic ordinal \(|\mathbf {I}\varvec{\Sigma }_n|\) by power of base 2. We also show a similar result for the structural transfinite induction, defined with fundamental sequences.

Keywords

Ordinal analysis Monotone transfinite induction Cofinal transfinite induction Structural transfinite induction Boundedness theorem 

Mathematics Subject Classification

03F30 03F15 

Notes

Acknowledgements

The author thanks Toshiyasu Arai for pointing out an error in the earlier version. He also thanks the anonymous referees for their invaluable suggestions. This publication was made possible through the support of a grant from the John Templeton Foundation (Grant No. 58229). The opinions expressed in this publication are those of the author and do not necessarily reflect the views of the John Templeton Foundation.

References

  1. 1.
    Beckmann, A.: Separating Fragments of Bounded Arithmetic. Ph.D. Thesis, University of Münster (1996)Google Scholar
  2. 2.
    Beklemishev, L.D.: Proof-theoretic analysis by iterated reflection. Arch. Math. Logic 42(6), 515–552 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Mints, G.E.: Exact estimates of provability of the rule of transfinite induction in initial parts of arithmetic. J. Soviet Math. 1, 85–91 (1973)CrossRefGoogle Scholar
  4. 4.
    Nemoto, T., Sato, K.: A marriage of Brouwer’s Intuitionism and Hilbert’s Finitism I: arithmetic. J. Symb. Logic.  https://doi.org/10.1017/jsl.2018.6 (to appear)
  5. 5.
    Sato, K.: A note on predicative ordinal analysis I: iterated comprehension and transfinite induction. J. Symb. Logic 84(1), 226–265 (2019)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Shirai, K.: A relation between transfinite induction and mathematical induction in elementary number theory. Tsukuba J. Math. 1, 91–124 (1977)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Troelstra, A., van Dalen, D.: Constructivism in mathematics, volume I. Elsevier, Amsterdam (1988)zbMATHGoogle 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