An incompleteness theorem via ordinal analysis
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 $\Pi0_1$-sound and $\Sigma0_1$-definable do not prove their own $\Pi0_1$-soundness, we prove that sufficiently strong theories that are $\Pi1_1$-sound and $\Sigma1_1$-definable do not prove their own $\Pi1_1$-soundness. Our proof does not involve the construction of a self-referential sentence but rather relies on ordinal analysis.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.