Papers
Topics
Authors
Recent
Search
2000 character limit reached

An incompleteness theorem via ordinal analysis

Published 20 Sep 2021 in math.LO | (2109.09678v2)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.