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.
be a countable admissible set.
-finite relational language.
This mathematical logic-related article is a stub.
You can help Wikipedia by expanding it.