Gödel's completeness theorem
GPTKB entity
Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:contrastsWith |
gptkb:Gödel's_incompleteness_theorems
|
| gptkbp:field |
gptkb:logic
gptkb:first-order_logic |
| gptkbp:formedBy |
gptkb:Kurt_Gödel
1929 |
| gptkbp:implies |
semantic entailment equals syntactic provability in first-order logic
|
| gptkbp:influenced |
gptkb:model_theory
proof theory |
| gptkbp:language |
gptkb:German
|
| gptkbp:originalTitle |
Über die Vollständigkeit des Logikkalküls
|
| gptkbp:publishedIn |
gptkb:Monatshefte_für_Mathematik_und_Physik
|
| gptkbp:relatedTo |
gptkb:Löwenheim–Skolem_theorem
compactness theorem |
| gptkbp:state |
Every logically valid formula in first-order logic is provable
|
| gptkbp:bfsParent |
gptkb:Compactness_theorem
gptkb:Completeness_theorem |
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Gödel's completeness theorem
|