Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
gptkb:first-order_logic
|
| gptkbp:field |
gptkb:logic
|
| gptkbp:generalizes |
finite satisfiability
|
| https://www.w3.org/2000/01/rdf-schema#label |
Compactness theorem
|
| gptkbp:implies |
existence of nonstandard models of arithmetic
existence of nonstandard models of set theory |
| gptkbp:provenBy |
gptkb:Kurt_Gödel
|
| gptkbp:relatedTo |
gptkb:Löwenheim–Skolem_theorem
gptkb:Gödel's_completeness_theorem |
| gptkbp:state |
If every finite subset of a set of first-order sentences is satisfiable, then the whole set is satisfiable.
|
| gptkbp:usedIn |
gptkb:algebra
gptkb:set_theory gptkb:topology model theory |
| gptkbp:yearProved |
1930
|
| gptkbp:bfsParent |
gptkb:logic
|
| gptkbp:bfsLayer |
4
|