English

Reflection ranks and ordinal analysis

Logic 2023-06-22 v2

Abstract

It 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-orderness phenomenon by studying a coarsening of the consistency strength order, namely, the Π11\Pi^1_1 reflection strength order. We prove that there are no descending sequences of Π11\Pi^1_1 sound extensions of ACA0\mathsf{ACA}_0 in this order. Accordingly, we can attach a rank in this order, which we call reflection rank, to any Π11\Pi^1_1 sound extension of ACA0\mathsf{ACA}_0. We prove that for any Π11\Pi^1_1 sound theory TT extending ACA0+\mathsf{ACA}_0^+, the reflection rank of TT equals the proof-theoretic ordinal of TT. We also prove that the proof-theoretic ordinal of α\alpha iterated Π11\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.

Keywords

Cite

@article{arxiv.1805.02095,
  title  = {Reflection ranks and ordinal analysis},
  author = {Fedor Pakhomov and James Walsh},
  journal= {arXiv preprint arXiv:1805.02095},
  year   = {2023}
}
R2 v1 2026-06-23T01:46:03.050Z