Here is a topological proof of the compactness theorem for propositional logic. The advantage of this proof over the purely logical, inductive proof is that it works when there are uncountably many propositional variables (which may be relevant when dealing with uncountable objects, e.g. a graph with vertex set ). Thanks to Linus Richter and … Continue reading The compactness theorem for propositional logic