In the early twentieth century, the mathematician David Hilbert proposed an ambitious goal for the whole field: put all of mathematics on completely secure footing by finding a fixed set of axioms and rules of inference powerful enough that every true mathematical statement could, at least in principle, be proven from them — and then prove that system itself was free of internal contradiction. In 1931, a 25-year-old logician named Kurt Gödel showed the goal was impossible, for any system rich enough to describe ordinary arithmetic.
A sentence that talks about its own unprovability
Gödel's method was to give every statement and every proof in a formal system a unique number — a way of encoding sentences about the system as numbers inside the system itself. Using that encoding, he constructed a specific mathematical statement that, translated out of the numbers, effectively says: "this statement cannot be proven within this system." That sentence creates an inescapable bind. If the system could prove it, the system would be proving something false — a contradiction. So a consistent system can't prove it. But that means the statement is, in fact, true — the system genuinely can't prove it — and true, unprovable statements are exactly what mathematicians mean by an incomplete system.
Consistent or complete — pick one, not both
Gödel's first incompleteness theorem says any consistent formal system capable of expressing basic arithmetic will always contain true statements it cannot prove from within itself. His second incompleteness theorem goes further: such a system cannot even prove its own consistency using only its own rules — to check that the system is contradiction-free, you need to step outside it. Together, the two theorems didn't just complicate Hilbert's program. They ended it: no system meeting the starting requirements could ever deliver both completeness and a self-contained proof of its own soundness.
What we're still unsure about
Gödel's actual result is precise and narrow: a specific claim about formal axiomatic systems capable of arithmetic. Popular writing routinely stretches it much further — into claims about the human mind, artificial intelligence, or the nature of truth generally — and logicians and philosophers still actively disagree about which of those extensions are legitimate and which overreach a result that was never about minds or machines in the first place. Some philosophers argue the theorems say something real about the limits of any rule-following system, including a computer; others argue that leap smuggles in unstated assumptions Gödel's proof never licensed. That boundary — what the theorem actually implies beyond mathematics — remains genuinely unsettled, not a rounding error in an otherwise closed case.
This sits inside Gödel's Incompleteness Theorems, one of seven topics in Logic, one of five domains in Philosophy, one of seventeen subjects the app can quiz you on.