Constraint satisfaction problems, compactness and non-measurable sets
By: Claude Tardif
Potential Business Impact:
Proves math ideas or finds impossible numbers.
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.
Similar Papers
Compact Quantitative Theories of Convex Algebras
Logic in Computer Science
Finds math rules for measuring distances.
Homomorphism Problems in Graph Databases and Automatic Structures
Logic in Computer Science
Makes computer questions about data easier to answer.
A General (Uniform) Relational Semantics for Sentential Logics
Logic in Computer Science
Makes many different logic systems work the same.