Skip to main content

Welcome to a Grasp lesson

Create a free account to keep studying and create your own study path.

Lesson 22

Gödel's Second Incompleteness Theorem and Foundationalism

Recommended resources

Introduction

In our last lesson, we wrestled with the philosophical fallout from Gödel's first incompleteness theorem (G1). We saw that for any sufficiently strong and consistent formal system, there is a true sentence that is unprovable within it. This forced us to confront a deep philosophical question: does mathematical truth outrun formal proof? We concluded that the answer depends on whether one adopts a realist (Platonist) or anti-realist view of mathematics, with G1 sharpening the debate rather than settling it.

Today, we turn to Gödel's second incompleteness theorem (G2) and its even more direct impact on the foundational projects of the early 20th century. The learning outcome for this lesson is to assess the philosophical impact of the second incompleteness theorem on foundationalist programmes in mathematics. We will focus on its effect on Hilbert's Programme, the most ambitious foundationalist project of its time, which sought to place all of mathematics on an absolutely certain and secure footing.

Axioms, Theorems, and Undecidable Statements
This diagram represents a formal axiomatic system. The axioms at the top are the foundation from which theorems are derived. The red dashed lines point to statements that lie outside the system's deductive reach, a phenomenon whose ultimate significance was revealed by Gödel's work.

The Dream of Absolute Certainty: Hilbert's Programme

To understand the impact of G2, we first need to appreciate the problem it was responding to. In the early 20th century, the discovery of paradoxes in set theory (like Russell's paradox) had triggered a "foundational crisis." David Hilbert, a leading mathematician of the era, proposed a bold programme to restore certainty to mathematics. His goal was to save infinitary mathematics (like analysis and set theory), which he saw as a "paradise" from which mathematicians should not be expelled.

The following reading from Neil Barton's course notes clearly outlines Hilbert's strategy.

[PDF] Week 4. Hilbert's Formalism - Neil Barton

These notes explain Hilbert's distinction between secure 'finitary' mathematics and powerful but questionable 'ideal' or 'infinitary' mathematics. The goal of his programme was to justify the use of the latter.

Please read Section 1, 'Formalism and Finitism', and Section 2, 'Hilbert’s Programme'. Focus on the distinction between 'real' and 'ideal' statements and the two-step strategy Hilbert proposed to secure ideal mathematics.

As the notes explain, Hilbert's Programme had two main objectives:

  1. Completeness: To formalize all of mathematics into a single axiomatic system that could, in principle, prove or disprove any mathematical statement.
  2. Finitary Consistency Proof: To prove that this powerful system was consistent (i.e., would never lead to a contradiction) using only elementary, 'finitary' methods (roughly, what we can formalize in a weak system like Primitive Recursive Arithmetic, or PRA).

The first goal was a hope for total knowledge. The second was the crucial "insurance policy." It would show that even though infinitary methods talk about abstract objects we can't directly inspect, they would never lead us astray in the concrete, finitary part of mathematics. As we saw last time, Gödel's first theorem shattered the goal of completeness. Now, let's see what the second theorem did to the insurance policy.


The Final Blow: The Second Incompleteness Theorem (G2)

The second incompleteness theorem is a direct and profound consequence of the first. In essence, it states:

Gödel's Second Incompleteness Theorem (G2): Any consistent formal system that is strong enough to carry out basic arithmetic cannot prove its own consistency.

The statement "T is consistent" can be expressed as a sentence in the language of arithmetic, often written as . G2 shows that if is indeed consistent, is another example of a true but unprovable statement within .

How does this follow from G1? The key is that the entire proof of the first incompleteness theorem can itself be formalized within arithmetic. Let's watch a short video that walks through this elegant and devastating argument.

The Gödel incompleteness phenomenon

Professor Joel David Hamkins explains how the second incompleteness theorem follows from the first by formalizing the proof of G1 within the system itself.

Please watch from 41:51 to 45:01. The core argument is presented between 42:49 and 45:01. Follow the reasoning: the proof of G1 shows that 'If T is consistent, then the Gödel sentence G is true (and unprovable)'. When formalized, this becomes a theorem inside T: T ⊢ Con(T) → G. The rest of the argument follows from this fact.

Let's summarize the steps of the reasoning:

  1. From our last lesson, we know that the Gödel sentence is equivalent to "I am not provable in ".
  2. The proof of G1 establishes the conditional: If is consistent, then is unprovable (and therefore true).
  3. This entire line of reasoning can be formalized and proven within the system itself. This gives us the theorem: .
  4. Now, suppose for the sake of argument that could prove its own consistency. That is, suppose .
  5. By the rule of modus ponens, from and , it would follow that .
  6. But G1 showed that if is consistent, it cannot prove .
  7. Therefore, our initial supposition must be false. A consistent system cannot prove .

This result directly demolishes the second, and arguably more critical, part of Hilbert's Programme. Hilbert wanted to use a simple, finitary theory (like PRA) to prove the consistency of a much more powerful, infinitary theory (like set theory). But G2 shows that the powerful theory cannot even prove its own consistency, let alone have its consistency proven by a weaker theory like . The dream of an absolute, internally-guaranteed foundation was gone.


Assessing the Aftermath: The Fate of Foundationalism

The philosophical impact of G2 was immense. It forced a re-evaluation of what a "foundation" for mathematics could possibly be.

The Refutation of Hilbert's Programme

It is widely agreed that G2 refuted Hilbert's Programme in its original, ambitious form. The goal of securing infinitary mathematics with a risk-free, finitary proof was shown to be mathematically impossible.

[PDF] On the Philosophical Relevance of Gödel's Incompleteness Theorems

This paper by Panu Raatikainen provides a direct philosophical assessment of Gödel's impact on Hilbert's Programme, concluding that it was indeed refuted.

Please read the section titled 'The fate of Hilbert’s program' (page 1). It clearly states the ways in which Gödel's theorems, particularly G2, made the original programme impossible to carry out.

The "Relativized" Programme

However, this was not the end of foundational studies. Instead, Hilbert's Programme was transformed. The quest for absolute certainty was replaced by a more nuanced, "relativized" programme.

  • Relative Consistency Proofs: While we cannot prove PA ⊢ Con(PA), we can prove the consistency of weaker theories from stronger ones. For example, standard set theory (ZFC) is strong enough to prove that Peano Arithmetic (PA) is consistent. We can write this as ZFC ⊢ Con(PA).
  • A Hierarchy of Confidence: This creates a hierarchy of formal systems, ordered by "consistency strength." A proof of Con(PA) from ZFC doesn't give us absolute certainty in PA; it tells us that PA is consistent if ZFC is consistent. Our confidence in arithmetic is thus transferred to our confidence in set theory.
  • The Role of Philosophy: This new situation brings philosophy back to the forefront. Since we can never have an ultimate, self-verifying foundational theory, the choice of which axioms to accept (e.g., the axioms of ZFC, or even stronger axioms like those for large cardinals) cannot be justified on purely mathematical grounds. As Professor Hamkins notes in the Q&A portion of his video (LINK, 01:16:58-01:18:30), mathematicians are forced to engage in what are essentially philosophical arguments about the intuitive evidence, fruitfulness, and justification for new axioms.

Impact on Other Foundationalisms

The impact of G2 extends beyond Hilbert's specific programme. Consider Logicism, the thesis that mathematics is reducible to logic. As Raatikainen discusses (LINK, section 3), G2 poses a serious epistemic problem for this view. Even if a logicist could formulate a formal system of "logic" powerful enough to derive arithmetic, G2 implies that we could never know with mathematical certainty that this system is consistent. This undermines the logicist's goal of showing mathematics is grounded in the supposedly self-evident and secure truths of logic.


Conclusion

Today, we have explored the philosophical shockwave created by Gödel's second incompleteness theorem. Where the first theorem showed that any single formal system is incomplete, the second theorem showed that no system can even vouch for its own coherence.

Key Takeaways:

  • G2 states that a sufficiently strong, consistent formal system cannot prove the arithmetical statement corresponding to its own consistency.
  • Impact on Hilbert's Programme: G2 delivered a decisive refutation to the programme's central goal of providing a finitary consistency proof for infinitary mathematics. It showed that the quest for absolute, self-verifying foundations is impossible.
  • The Transformation of Foundationalism: The failure of Hilbert's Programme led to a "relativized" approach. The goal is no longer absolute certainty, but calibrating the consistency of different theories against each other.
  • The Return of Philosophy: By closing the door on purely formal justification, G2 forces mathematicians and philosophers to debate the grounds for accepting foundational axioms—a debate that is necessarily philosophical in nature.

Preview of the Next Lesson:

Gödel's theorems revealed the limits of the proof-theoretic approach to logic and foundations, which conceives of logic as a system of formal deduction. This opened the door for a different perspective to gain prominence: the model-theoretic or semantic approach. In our next lesson, we will begin our fifth module, "The Nature of Logical Consequence," by examining Tarski's semantic theory of truth, a landmark attempt to give a rigorous definition of truth for formal languages and, from it, a new definition of logical consequence itself.