Graph ›
The Completeness Theorem
The Completeness Theorem
foundations results equations depends_on (declared) depends_on (declared) depends_on (declared) depends_on (declared) depends_on (declared) depends_on (declared) depends_on (declared) depends_on (declared) depends_on (declared) depends_on (declared) depends_on (declared) depends_on (declared) depends_on (declared) depends_on (declared) depends_on (declared) depends_on (declared) depends_on (declared) definition A4.2: Maximal consistent A4.2 Maximal consiste… definition A4.6: The term structure A4.6 The term structu… theorem A4.1: Soundness A4.1 Soundness lemma A4.3: Lindenbaum A4.3 Lindenbaum lemma A4.4: Behaviour of a maximal consistent set A4.4 Behaviour of a m… lemma A4.5: Adding witnesses preserves consistency A4.5 Adding witnesses… lemma A4.7: lem:app-comp-welldefined A4.7 lemma lemma A4.8: Truth lemma A4.8 Truth lemma theorem A4.9: Model existence A4.9 Model existence theorem A4.10: Completeness A4.10 Completeness corollary A4.11: Compactness A4.11 Compactness equation A4.4: eq:app-comp-Tstar eq. (A4.4) The chain of The Completeness Theorem: 12 of 12 objects, read left to right from what the chapter assumes to what tests it. Solid lines are declared logical edges, dashed ones were inferred from the structure of the source. Click any node to open its own chain.