The Most Important Mathematical Results of the 20th Century
In 1931, Kurt Gödel proved two theorems that permanently changed mathematics. The first: any consistent formal system powerful enough to express arithmetic contains true statements it cannot prove. The second: such a system cannot prove its own consistency. These results ended a decades-long program to put all mathematics on a complete, consistent, mechanical foundation.
Naive Set Theory and Russell's Paradox
Cantor's set theory defined a set as any collection determined by a property: {x : P(x)}. This is powerful — most of modern mathematics can be built from it. Frege formalized it in his Grundgesetze der Arithmetik. In 1901, Bertrand Russell sent Frege a le
ZFC: The Standard Foundation
Zermelo-Fraenkel set theory with the Axiom of Choice (ZFC) resolves Russell's paradox by restricting set formation. You cannot form a set from an arbitrary property — you can only form subsets of sets that already exist. Key axioms: extensionality (sets w
Cantor's Diagonal Argument
Cantor proved that the real numbers are uncountably infinite: no bijection exists from the natural numbers to the reals. Proof: suppose a complete listing r_1, r_2, r_3, ... exists. Construct a real number d by making d's nth decimal digit differ from the
Gödel's Completeness and First Incompleteness Theo
Gödel's 1929 completeness theorem: every logically valid first-order formula has a formal proof. Syntax and semantics align. Then in 1931, using arithmetization — encoding statements and proofs as natural numbers — Gödel constructed a formula G that asser
Gödel's Second Incompleteness Theorem
Gödel's second theorem: if F is a consistent formal system containing basic arithmetic, then F cannot prove its own consistency. The statement "F is consistent" can be expressed in arithmetic using arithmetization, and Gödel showed it is equivalent to the
Go Deeper: Gödel's Arithmetic Encoding and Abstract Algebra
Gödel proved his theorems by carefully encoding statements about proofs as statements about numbers — an algebraic encoding technique closely related to ring and field theory. Abstract algebra is the language that makes such structural encoding precise and reveals why it works.
