Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
infinitary logic
|
| gptkbp:concerns |
large cardinals
ultrafilters |
| gptkbp:field |
gptkb:set_theory
|
| gptkbp:generalizes |
compactness theorem for first-order logic
|
| https://www.w3.org/2000/01/rdf-schema#label |
Kunen's compactness theorem
|
| gptkbp:namedAfter |
gptkb:Kenneth_Kunen
|
| gptkbp:publicationYear |
1971
|
| gptkbp:publishedIn |
gptkb:Journal_of_Symbolic_Logic
|
| gptkbp:state |
If there exists a weakly compact cardinal, then every set of sentences in the infinitary language L_{κ,κ} that is finitely satisfiable is satisfiable.
|
| gptkbp:bfsParent |
gptkb:Kenneth_Kunen
|
| gptkbp:bfsLayer |
7
|