Gödel's completeness theorem (FOL)

Layer 0 — Mathematicsin the formal-systems-limits subtree

For first-order logic, semantic validity coincides with syntactic provability. Proven by Gödel in his 1929 dissertation; Henkin's 1949 proof uses maximal-consistent extension with witness constants. Distinct from — and not contradicted by…

Related concepts

Explore Gödel's completeness theorem (FOL) on the interactive knowledge graph →