Gentzen's consistency proof of PA (ε₀-induction)

Layer 0 — Mathematicsin the formal-systems-limits subtree

Primitive recursive arithmetic plus transfinite induction up to (but not including) ε₀ — the first fixed point of α ↦ ω^α — proves the consistency of Peano arithmetic. Gentzen 1936. Aligns with Gödel's 2nd incompleteness: ε₀-induction is…

Related concepts

Explore Gentzen's consistency proof of PA (ε₀-induction) on the interactive knowledge graph →