theorem 3.84 Gödel's completeness theorem, 1930

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

Rests on

Supports

Neighborhood

Every logical edge within two steps of this node.

theorem 3.84: Gödel's completeness theorem, 19303.84definition 3.82: Consistency, completeness, soundness3.82definition 3.80: Formal system3.80theorem A.30: Church, TuringA.30proof : ch:01-logic-sets@prooflink-2proofdefinition 3.7: Negation3.7definition A.5: Maximal consistentA.5lemma A.8: Adding witnesses preserves consistencyA.8theorem 3.87: Gödel, 19313.87theorem 3.91: Tarski's undefinability of truth3.91definition A.16: RepresentabilityA.16definition 3.81: Effective axiomatization3.81definition 3.83: Peano arithmetic3.83lemma 3.86: Diagonal lemma3.86theorem 3.98: Church–Turing3.98theorem A.17: RepresentabilityA.17theorem 3.96: Turing3.96proof : app:A-long-proofs@proof-24proof

Edges

typedirectionnode provenancewhere
cites Die Vollständigkeit der Axiome des logischen Funktionenkalküls derived parts/02-mathematical-methods/01-logic-sets.tex:2385
depends_on Consistency, completeness, soundness declared parts/02-mathematical-methods/01-logic-sets.tex:2386
depends_on Formal system declared parts/02-mathematical-methods/01-logic-sets.tex:2386
depends_on Church, Turing declared appendices/A-long-proofs.tex:2581
proves ch:01-logic-sets@prooflink-2 declared parts/02-mathematical-methods/01-logic-sets.tex:2388