On the Cardinality of Arithmetical Proof Spaces

This monograph presents a non-reflexive proof of Gödel’s First Incompleteness Theorem. That is: we demonstrate the incompleteness of first-order arithmetic without relying on self-reference, paradoxes, or diagonalization. Instead, we base our proof on a cardinality mismatch: the set of arithmetical truths is countable, but the space of candidate proof-sets over those truths has the cardinality of the continuum. Thus, the system cannot, even in principle, admit a recursively enumerable set of axioms that proves all and only the true arithmetical statements—some truths must go unprovable. This is the substance of Theorem 0. We call this result a non-reflexive proof of incompleteness, in contrast to Gödel’s original argument, which crucially relies on self-reference and the arithmetization of syntax. Our proof avoids any appeal to statements like “This sentence is unprovable.” It is entirely based on set-theoretic and logical properties of arithmetic and its metatheory.