Barwise compactness theorem

In mathematical logic, the Barwise compactness theorem, named after Jon Barwise, is a generalization of the usual compactness theorem for first-order logic to a certain class of infinitary languages. It was stated and proved by Barwise in 1967.

Statement

Let $A$ be a countable admissible set. Let $L$ be an $A$-finite relational language. Suppose $\mathrm{\Gamma }$ is a set of $L_A$-sentences, where $\mathrm{\Gamma }$ is a ${\mathrm{\Sigma }}_1$ set with parameters from $A$, and every $A$-finite subset of $\mathrm{\Gamma }$ is satisfiable. Then $\mathrm{\Gamma }$ is satisfiable.

References

• Template:Cite thesis
• Template:Cite book
• Template:Cite book

External links

• Stanford Encyclopedia of Philosophy: "Infinitary Logic", Section 5, "Sublanguages of L(ω1,ω) and the Barwise Compactness Theorem"

Template:Mathlogic-stub