Propositional compactness theorem
= Propositional compactness theorem
A set of propositions has a model exactly when every finite subset has a model. Syntactically, a contradiction uses only finitely many assumptions, and every consistent set extends by <Zorn lemma> to a <maximal consistent set in propositional logic>.