Gödel’s second incompleteness theorem

logic

Also known as: Gödel’s consistency on proofs theorem

Written by

The Information Architects of Encyclopaedia Britannica

Last updated

June 29, 2026

Quick Summary

Gödel's second incompleteness theorem, a corollary to his first, states that any formal system containing arithmetic cannot prove its own consistency. This means that it's impossible to demonstrate that such a system is free of contradictions using only the rules and axioms within that system. The theorem highlights a fundamental limitation in formal systems, impacting the philosophy of mathematics by showing that absolute certainty about a system's consistency cannot be achieved from within the system itself.12

Summary created from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles.

2 Britannica Sources

Ask Britannica AI about this topic

Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.

incompleteness theorem
The second incompleteness theorem follows as an immediate consequence, or corollary, from Gödel’s paper. Although it was not stated explicitly in the paper, Gödel was aware of it, and other mathematicians, such as the Hungarian-born American mathematician John von Neumann, realized immediately that it followed as…
Read More
The second incompleteness theorem follows as an immediate consequence, or corollary, from Gödel’s paper. Although it was not stated explicitly in the paper, Gödel was aware of it, and other mathematicians, such as the Hungarian-born American mathematician John von Neumann, realized immediately that it followed as…
Read More

history of logic
Gödel’s incompleteness theorems
…within arithmetic, is known as Gödel’s second incompleteness theorem. This result showed that Hilbert’s project of proving the consistency of arithmetic was doomed to failure. The consistency of arithmetic can be proved only by means stronger than those provided by arithmetic itself.
Read More
…within arithmetic, is known as Gödel’s second incompleteness theorem. This result showed that Hilbert’s project of proving the consistency of arithmetic was doomed to failure. The consistency of arithmetic can be proved only by means stronger than those provided by arithmetic itself.
Read More

metalogic
The two incompleteness theorems
More exactly, Gödel showed that, if the system is consistent, then p is not provable; if it is ω-consistent, then ∼p is not provable. The first half leads to Gödel’s theorem on consistency proofs, which says that if a system is consistent, then the arithmetic sentence expressing…
Read More
More exactly, Gödel showed that, if the system is consistent, then p is not provable; if it is ω-consistent, then ∼p is not provable. The first half leads to Gödel’s theorem on consistency proofs, which says that if a system is consistent, then the arithmetic sentence expressing…
Read More