Papalocal
Loading…
Papalocal · Things
Work

Gentzen's consistency proof

Gentzen's consistency proof is a mathematical logic concept.

All 1 facts, and where they come from

Facts

1 facts · 0 confirmed by two sources · 0 cited · 1 from one source

What it is
mathematical concept One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 18, 2026 · revision 2473378961
Described as
mathematical logic concept
What it is
mathematical concept
Wikipedias with a page
3

Wikidata item Q5533794 (wikidata.org/wiki/Q5533794), public domain (CC0). Copied 2026-11-18.

What Wikipedia says · copied November 18, 2026 · revision 1370518151

Gentzen's consistency proof is a result of proof theory in mathematical logic, published by Gerhard Gentzen in 1936. It shows that the Peano axioms of first-order arithmetic do not contain a contradiction (i.e. are "consistent"), as long as a certain other system used in the proof does not contain any contradictions either. This other system, today called "primitive recursive arithmetic with the additional principle of quantifier-free transfinite induction up to the ordinal ε0", is neither weaker nor stronger than the system of Peano axioms. Gentzen argued that it avoids the questionable modes of inference contained in Peano arithmetic and that its consistency is therefore less controversial.

From the Wikipedia article “Gentzen's consistency proof” (en.wikipedia.org/wiki/Gentzen's_consistency_proof), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-18; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it