Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
abstract logic
|
| gptkbp:author |
gptkb:Per_Lindström
|
| gptkbp:concerns |
gptkb:first-order_logic
|
| gptkbp:field |
gptkb:logic
model theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Lindström's theorem
|
| gptkbp:namedAfter |
gptkb:Per_Lindström
|
| gptkbp:publishedIn |
gptkb:Theoria
|
| gptkbp:relatedTo |
gptkb:Löwenheim–Skolem_theorem
compactness theorem |
| gptkbp:state |
First-order logic is the strongest logic satisfying both the compactness theorem and the Löwenheim–Skolem theorem.
|
| gptkbp:yearProposed |
1969
|
| gptkbp:bfsParent |
gptkb:finite_model_theory
|
| gptkbp:bfsLayer |
5
|