한
← All rivers
River of knowledge

The River of Logic and Proof

Where did the dream of fully symbolic reasoning meet its limits?

Aristotle's syllogism → Leibniz's symbolic dream → Boole and Frege → Hilbert's early-1920s program → Gödel → 21st-century proof assistants.

384 BCE–20245 city-to-city segments

Read the current

What changed between the cities?

  1. 1

    300 BCE–1637

    problem reformulation

    AlexandriaLeiden

    A Tool Grammar Was Translated into Degrees of Equations

    *La Géométrie*, printed in Leiden, advanced a way to treat segment relations algebraically and curves by equations. It opened a path for translating constructibility into properties of numbers and polynomials. Descartes did not anticipate Wantzel's 1837 theorem, but algebra became an essential shoulder for proving geometric limits.

    What Can Lines and Circles Build? — The Elements' Tool Grammar → Translating Geometric Problems into Degrees of Equations — Descartes
    Place this segment on the map
  2. 2

    1854–1928

    publication network

    CorkGöttingen

    From Calculating Logic to Dreaming of a Universal Decision

    *Principles of Mathematical Logic* asked whether a finite procedure could determine whether any logical expression is universally valid. The *Entscheidungsproblem* posed an ambitious question before “mechanical method” had a precise definition. Göttingen marks the Hilbert school’s teaching and research context, not an exact writing room or publication city.

    Boole — Calculating with Forms of Reasoning → Hilbert and Ackermann — Can Every Logical Problem Be Decided?
    Place this segment on the map
  3. 3

    1928–1931

    institutional problem network

    GöttingenVienna

    A Program for Completeness Met a Limit from Within

    Gödel showed that effectively axiomatized systems strong enough for natural-number arithmetic contain statements they cannot decide under specified consistency assumptions, and generally cannot prove their own consistency by their own means. This does not say that all mathematics is wrong or settle the power of every machine not yet defined.

    Hilbert and Ackermann — Can Every Logical Problem Be Decided? → Gödel — Formalization Reveals Its Own Limits
    Place this segment on the map
  4. 4

    1936

    independent comparison

    PrincetonCambridge

    Independent Models of Computation Reached the Same Boundary

    Alongside Church’s lambda calculus, Turing modelled a person following symbol-manipulation rules as an abstract machine. The agreement of distinct models helped establish a mathematical account of effective procedure.

    Church — Defining Computation Through Function Substitution → Turing — Modelling a Procedure as a Machine
    Place this segment on the map
  5. 5

    1936–1970

    theorem extension

    CambridgeSaint Petersburg

    From Machine Halting to Undecidable Integer Equations

    Matiyasevich represented exponential growth from Fibonacci numbers with Diophantine equations, resolving the remaining conjecture in Julia Robinson's program. Combined with work by Davis, Putnam, and Robinson, it proved that no algorithm always decides whether an arbitrary integer-coefficient polynomial has an integer solution. Individual equations can still be solved.

    Turning the Human Calculator into a Machine and Proving Some Runs Cannot Be Decided — Turing → There Is No Universal Decider for Integer Equations — The DPRM Theorem
    Place this segment on the map

How to read the lines

Each line is an editorial route through problems, texts, and practices. It does not imply one book moving in a straight line, a sole invention, or identical adoption everywhere.