A Compactness Theorem for Infinite Constraint Satisfaction
A b s t r a c t.
A useful compactness theorem for constraint satisfaction problems is proved
equivalent to BPI, the Boolean Prime Ideal Theorem. The relation of various
restricted versions of the Theorem to each other and to BPI is also explored.