Jump to content

Barwise compactness theorem

From Wikipedia, the free encyclopedia

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

[edit]

Let be a countable admissible set. Let be an -finite relational language. Suppose is a set of -sentences, where is a set with parameters from , and every -finite subset of is satisfiable. Then is satisfiable.

References

[edit]
  • Barwise, J. (1967). Infinitary Logic and Admissible Sets (PhD). Stanford University.
  • Ash, C. J.; Knight, J. (2000). Computable Structures and the Hyperarithmetic Hierarchy. Elsevier. ISBN 0-444-50072-3.
  • Barwise, Jon; Feferman, Solomon; Baldwin, John T. (1985). Model-theoretic logics. Springer-Verlag. p. 295. ISBN 3-540-90936-2.
[edit]