Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
gptkb:L_{ω_1,ω}_logic
|
| gptkbp:concerns |
gptkb:infinitary_logic
|
| gptkbp:field |
gptkb:logic
gptkb:model_theory |
| gptkbp:generalizes |
compactness theorem
|
| gptkbp:namedAfter |
gptkb:Jon_Barwise
|
| gptkbp:publishedIn |
1970s
|
| gptkbp:relatedTo |
admissible set theory
infinitary languages |
| gptkbp:state |
If every countable subset of a set of L_{ω_1,ω} sentences is satisfiable, then the whole set is satisfiable in an admissible set.
|
| gptkbp:bfsParent |
gptkb:Jon_Barwise
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Barwise compactness theorem
|