An incompleteness theorem via ordinal analysis
arXiv:2109.09678
Abstract
We present an analogue of Gödel's second incompleteness theorem for systems of second-order arithmetic. Whereas Gödel showed that sufficiently strong theories that are -sound and -definable do not prove their own -soundness, we prove that sufficiently strong theories that are -sound and -definable do not prove their own -soundness. Our proof does not involve the construction of a self-referential sentence but rather relies on ordinal analysis.