Jump to navigation Jump to search
This category contains pages concerning Compactness Theorem:
Let $\LL$ be the language of predicate logic.
Let $T$ be a set of $\LL$-sentences.
Then $T$ is satisfiable if and only if $T$ is finitely satisfiable.
Pages in category "Compactness Theorem"
The following 4 pages are in this category, out of 4 total.