lemma 3.86 Diagonal lemma

open in the book · parts/02-mathematical-methods/01-logic-sets.tex:2436 · p. 47

Rests on

Supports

Neighborhood

Every logical edge within two steps of this node.

lemma 3.86: Diagonal lemma3.86definition 3.83: Peano arithmetic3.83definition 3.80: Formal system3.80theorem 3.87: Gödel, 19313.87theorem 3.91: Tarski's undefinability of truth3.91proof : ch:01-logic-sets@prooflink-3proofaxiom 3.33: Peano axioms3.33axiom 3.34: Principle of induction3.34lemma A.19: Numerals behaveA.19theorem 3.88: Gödel's second incompleteness theorem3.88definition A.16: RepresentabilityA.16definition 3.82: Consistency, completeness, soundness3.82definition 3.81: Effective axiomatization3.81theorem 3.98: Church–Turing3.98theorem 3.84: Gödel's completeness theorem, 19303.84equation 3.86: eq:provability-predicate3.86theorem A.29: Second incompleteness theoremA.29proof : ch:01-logic-sets@proof-20proofproof : ch:01-logic-sets@proof-22proof

Edges

typedirectionnode provenancewhere
depends_on Peano arithmetic declared parts/02-mathematical-methods/01-logic-sets.tex:2444
depends_on Formal system declared parts/02-mathematical-methods/01-logic-sets.tex:2444
depends_on Gödel, 1931 declared parts/02-mathematical-methods/01-logic-sets.tex:2471
depends_on Tarski's undefinability of truth declared parts/02-mathematical-methods/01-logic-sets.tex:2639
proves ch:01-logic-sets@prooflink-3 declared parts/02-mathematical-methods/01-logic-sets.tex:2446