Abstract
Schmerl and Beklemishev’s work on iterated reflection achieves two aims: it introduces the important notion of \(\varPi ^0_1\)-ordinal, characterizing the \(\varPi ^0_1\)-theorems of a theory in terms of transfinite iterations of consistency; and it provides an innovative calculus to compute the \(\varPi ^0_1\)-ordinals for a range of theories. The present note demonstrates that these achievements are independent: we read off \(\varPi ^0_1\)-ordinals from a Schütte-style ordinal analysis via infinite proofs, in a direct and transparent way.
Similar content being viewed by others
References
Beklemishev, L.: Proof-theoretic analysis by iterated reflection. Arch. Math. Logic 42(6), 515–552 (2003)
Buchholz, W.: Notation systems for infinitary derivations. Arch. Math. Logic 30, 277–296 (1991)
Fairtlough, M., Wainer, S.S.: Hierarchies of provably recursive functions. In: Buss, S. (ed.) Handbook of Proof Theory, pp. 149–207. Elsevier, New York (1998)
Kreisel, G., Lévy, A.: Reflection principles and their use for establishing the complexity of axiomatic systems. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 14, 97–142 (1968)
Schmerl, U.R.: A fine structure generated by reflection formulas over primitive recursive arithmetic. In: Boffa, M., van Dalen, D., MacAloon, K. (eds.) Logic Colloquium ‘78, pp. 335–350. North Holland, New York (1979)
Schmerl, U.R.: Iterated reflection principles and the \(\omega \)-rule. J. Symb. Logic 47(4), 721–733 (1982)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Freund, A. A note on iterated consistency and infinite proofs. Arch. Math. Logic 58, 339–346 (2019). https://doi.org/10.1007/s00153-018-0639-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-018-0639-y
Keywords
- Iterated consistency
- Ordinal analysis
- \(\varPi ^0_1\)-ordinal
- Infinite proofs
- \(\omega \)-rule
- Cut elimination