2000 character limit reached
A Note on Iterated Consistency and Infinite Proofs
Published 5 Sep 2017 in math.LO | (1709.01540v2)
Abstract: Schmerl and Beklemishev's work on iterated reflection achieves two aims: It introduces the important notion of $\Pi0_1$-ordinal, characterizing the $\Pi0_1$-theorems of a theory in terms of transfinite iterations of consistency; and it provides an innovative calculus to compute the $\Pi0_1$-ordinals for a range of theories. The present note demonstrates that these achievements are independent: We read off $\Pi0_1$-ordinals from a Sch\"utte-style ordinal analysis via infinite proofs, in a direct and transparent way.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.