Author:
PAKHOMOV FEDOR,WALSH JAMES
Abstract
AbstractIt is well-known that natural axiomatic theories are well-ordered by consistency strength. However, it is possible to construct descending chains of artificial theories with respect to consistency strength. We provide an explanation of this well-orderedness phenomenon by studying a coarsening of the consistency strength order, namely, the
$\Pi ^1_1$
reflection strength order. We prove that there are no descending sequences of
$\Pi ^1_1$
sound extensions of
$\mathsf {ACA}_0$
in this ordering. Accordingly, we can attach a rank in this order, which we call reflection rank, to any
$\Pi ^1_1$
sound extension of
$\mathsf {ACA}_0$
. We prove that for any
$\Pi ^1_1$
sound theory T extending
$\mathsf {ACA}_0^+$
, the reflection rank of T equals the
$\Pi ^1_1$
proof-theoretic ordinal of T. We also prove that the
$\Pi ^1_1$
proof-theoretic ordinal of
$\alpha $
iterated
$\Pi ^1_1$
reflection is
$\varepsilon _\alpha $
. Finally, we use our results to provide straightforward well-foundedness proofs of ordinal notation systems based on reflection principles.
Publisher
Cambridge University Press (CUP)
Reference27 articles.
1. Reflection calculus and conservativity spectra
2. Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
3. [9] Beklemishev, L. and Pakhomov, F. , Reflection algebras and conservation results for theories of iterated truth, 2019. arXiv:1908.10302.
4. Calibrating provability logic: From modal logic to reflection calculus;Beklemishev;Advances in Modal Logic,2012
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献