paper

Wellfoundedness proof with the maximal distinguished set

arXiv:2211.08619

Abstract

In arXiv:2208.12944 it is shown that an ordinal is an upper bound for the proof-theoretic ordinal of a set theory . In this paper we show that a second order arithmetic $Σ^{1-}_{2}\mbox{-CA}+Π^{1}_{1}\mbox{-CA}_{0}$ proves the wellfoundedness up to for each . It is easy to interpret $Σ^{1-}_{2}\mbox{-CA}+Π^{1}_{1}\mbox{-CA}_{0}$ in .

arXiv admin note: text overlap with arXiv:1506.05280, arXiv:2112.09871, arXiv:2208.12944

Wellfoundedness proof with the maximal distinguished set · wovepaper