Constraint satisfaction problems, compactness and non-measurable sets
classification
🧮 math.LO
cs.LO
keywords
compactnessexistencefinitenon-measurablerelationalsetsstructureaxiom
read the original abstract
A finite relational structure A is called compact if for any infinite relational structure B of the same type, the existence of a homomorphism from B to A is equivalent to the existence of homomorphisms from all finite substructures of B to A. We show that if A has width one, then the compactness of A can be proved in the axiom system of Zermelo and Fraenkel, but otherwise, the compactness of A implies the existence of non-measurable sets in 3-space.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Equivalences of promise compactness principles
For structure pairs (A,B) without Olšák polymorphisms, the promise compactness K_(A,B) is equivalent to the ultrafilter principle over ZF, including K_(K3,K5) and K_(H2,Hc).
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.