An incompleteness theorem via ordinal analysis
Logic
2022-09-21 v2
Abstract
We present an analogue of G\"{o}del's second incompleteness theorem for systems of second-order arithmetic. Whereas G\"{o}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.
Keywords
Cite
@article{arxiv.2109.09678,
title = {An incompleteness theorem via ordinal analysis},
author = {James Walsh},
journal= {arXiv preprint arXiv:2109.09678},
year = {2022}
}