A Reflection Calculus for Bar Induction and the Linearity of Consistency Strength Ordering
Fedor Pakhomov, Vlad Lazar
Abstract
We introduce a novel extension of reflection calculus, RCBI, to analyze a family of extensions of ACA0 generated by uniform ω-model and syntactic reflection principles, together with several other related operators. The union of these theories coincides with the theory of Bar Induction (BI). We prove that RCBI is arithmetically sound, and that it is sound and complete with respect to a natural class of Kripke models. Leveraging these modal semantics, we demonstrate that the class of theories denoted by ∇-free closed formulas is a pre-wellordering with respect to Π11-soundness and consistency strength. This allows us to establish an ordinal analysis for BI and its fragments, analogous to Beklemishev's analysis of PA. The structural properties of RCBI naturally give rise to a novel ordinal notation system for the Bachmann-Howard ordinal which differs substantially from existing representations.
Create a lesson
Related papers
What David Teaches Goliath: An Inevitable Extension of ZFC
Ali Enayat
Measures in Nairian models, I
Gabriel Goldberg, Grigor Sargsyan
On separable pairs of fields and beautiful pairs of separably closed valued fields
Zhengqing He, Martin Hils
Fragments of SRP, the nonstationary ideal, and diagonal reflection
Gunter Fuchs, Hiroshi Sakai
Functional Projection and Complexity Reduction
Vera Fischer, Yurii Khomskii, Yipu Li et al.
On the foundations of logic and probability, II. Modal probability spaces
Loic Cosyns