The Number Path
Overview
The Number Path traces from Peano's axioms to Incompleteness theorems · Computer science. Density: high.
Interpretable in: zfc-path
Nodes
- Peano 1: Zero
- Peano 2: Successor
- Peano 3: Zero is not a successor
- Peano 4: Injectivity of successor
- Peano 5: Induction
- Gödel's incompleteness theorems
- Turing machine
- Halting problem (undecidability)
- Entscheidungsproblem (decision problem)
- Hyperoperation sequence & tetration
- Computability theory
- PFR conjecture formalization (Lean)