Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
gptkb:first-order_logic
|
| gptkbp:author |
gptkb:Leon_Henkin
|
| gptkbp:citation |
Henkin, L. (1949). The completeness of the first-order functional calculus. Journal of Symbolic Logic.
|
| gptkbp:field |
gptkb:logic
model theory |
| gptkbp:generalizes |
Henkin construction
|
| https://www.w3.org/2000/01/rdf-schema#label |
Omitting types theorem
|
| gptkbp:publicationYear |
1949
|
| gptkbp:relatedTo |
gptkb:Löwenheim–Skolem_theorem
completeness theorem compactness theorem |
| gptkbp:state |
For any countable first-order theory and countable set of non-principal types, there is a countable model omitting all those types.
|
| gptkbp:usedIn |
gptkb:nonstandard_analysis
proof theory construction of models |
| gptkbp:bfsParent |
gptkb:Model_Theory
|
| gptkbp:bfsLayer |
7
|