This timeline traces the foundational crisis of mathematics from Boolean logic and Cantor's transfinite sets through Gödel's incompleteness theorems and Turing machines, highlighting key developments in mathematical logic and set theory.
George Boole introduces symbolic logic, laying the groundwork for Boolean algebra and modern digital computing. #logic #mathematics
Boole expands his logical system, formalizing propositional logic and influencing later developments in set theory and computer science. #logic #mathematics
Richard Dedekind defines real numbers via Dedekind cuts, providing a rigorous foundation for analysis. #analysis #foundations
Georg Cantor demonstrates that the real numbers are uncountable, introducing diagonalization and revolutionizing set theory. #settheory #infinity
Gottlob Frege develops a formal logical notation, introducing quantifiers and predicate logic, a cornerstone of modern logic. #logic #philosophy
Cantor publishes his work on transfinite ordinals and cardinals, formalizing the concept of different sizes of infinity. #settheory #infinity
Frege attempts to derive arithmetic from logic, a key step in logicism and the foundations of mathematics. #logic #arithmetic
Giuseppe Peano axiomatizes natural numbers with the Peano axioms, influencing formal arithmetic. #axioms #arithmetic
Cantor establishes that if two sets inject into each other, they are equinumerous, a fundamental result in set theory. #settheory #infinity
Cesare Burali-Forti identifies a paradox concerning the set of all ordinals, highlighting inconsistencies in naive set theory. #paradox #settheory
Cantor conjectures that there is no set whose cardinality is strictly between that of the integers and the real numbers. #settheory #infinity
David Hilbert outlines 23 unsolved problems, including the continuum hypothesis and the consistency of arithmetic, shaping 20th-century mathematics. #problems #foundations
Bertrand Russell finds a contradiction in Frege's set theory: the set of all sets that do not contain themselves leads to a paradox. #paradox #settheory
Frege acknowledges Russell's paradox, undermining his logicist project and prompting the search for consistent foundations. #logic #foundations
Ernst Zermelo proves that every set can be well-ordered using the axiom of choice, sparking controversy. #settheory #axiomofchoice
Zermelo proposes an axiomatic set theory to avoid paradoxes, later extended to ZFC. #settheory #axioms
Whitehead and Russell publish the first volume of Principia Mathematica, attempting to derive mathematics from logic. #logic #foundations
The second volume continues the formal development, covering cardinal arithmetic and ordinal numbers. #logic #foundations
Leopold Löwenheim proves that if a first-order theory has an infinite model, it has a countable model, revealing limitations of first-order logic. #logic #modeltheory
Thoralf Skolem extends the theorem, leading to the Skolem paradox and deeper insights into model theory. #logic #modeltheory
Abraham Fraenkel improves Zermelo's axioms, leading to the ZFC set theory that becomes the standard foundation. #settheory #axioms
Skolem notes that ZFC has countable models despite asserting uncountable sets, highlighting the relativity of set-theoretic concepts. #paradox #settheory
Hilbert asks for an algorithm to decide the truth of any mathematical statement, a problem later solved by Turing and Church. #computability #logic
Kurt Gödel shows that first-order logic is complete: every valid statement has a proof, a key result in logic. #logic #completeness
Gödel proves that any consistent formal system containing arithmetic is incomplete and cannot prove its own consistency, shaking the foundations of mathematics. #incompleteness #logic
Alan Turing introduces the Turing machine, defines computability, and proves the undecidability of the halting problem. #computability #turing
Alonzo Church proves that there is no algorithm to decide the truth of statements in first-order logic, using lambda calculus. #undecidability #logic
Turing shows that no algorithm can determine whether a given Turing machine halts, a foundational result in computability theory. #undecidability #computability
Gödel shows that the continuum hypothesis cannot be disproved in ZFC, using the constructible universe L. #settheory #continuumhypothesis
Gödel's monograph details his proof that the continuum hypothesis is consistent with ZFC. #settheory #continuumhypothesis
ENIAC, the first general-purpose electronic computer, is built, enabling practical computation and influencing computability theory. #computing #history
Turing proposes the Turing test for machine intelligence, linking computability to artificial intelligence. #AI #turing
Paul Cohen uses forcing to show that the continuum hypothesis is independent of ZFC, completing the solution to Hilbert's first problem. #settheory #continuumhypothesis
Cohen's monograph details the forcing technique, revolutionizing set theory and independence proofs. #settheory #forcing
Yuri Matiyasevich completes the proof that no algorithm can determine whether a Diophantine equation has integer solutions, building on work by Davis, Putnam, and Robinson. #undecidability #numbertheory
Kenneth Appel and Wolfgang Haken prove the four color theorem using a computer, sparking debate about the role of computation in proofs. #computation #proof
Jeff Paris and Leo Harrington find a combinatorial statement independent of Peano arithmetic, demonstrating Gödelian phenomena in natural mathematics. #incompleteness #combinatorics
Harvey Friedman finds finite combinatorial statements independent of Peano arithmetic, further exploring incompleteness. #incompleteness #combinatorics
Andrew Wiles starts his secret proof of Fermat's Last Theorem, eventually using advanced number theory and modular forms. #numbertheory #proof
Andrew Wiles, with assistance from Richard Taylor, proves Fermat's Last Theorem, a landmark in number theory and mathematical logic. #numbertheory #proof
The Clay Mathematics Institute lists seven unsolved problems, including the P vs NP problem, continuing Hilbert's tradition. #problems #foundations
A previously unknown letter from Gödel to von Neumann is discovered, discussing P vs NP and computational complexity. #complexity #PvsNP
Vinay Deolalikar announces a proof that P ≠ NP, but the proof is later found to have flaws, highlighting the difficulty of the problem. #complexity #PvsNP