Score: 0

Constraint satisfaction problems, compactness and non-measurable sets

Published: August 20, 2025 | arXiv ID: 2508.14838v1

By: Claude Tardif

Potential Business Impact:

Proves math ideas or finds impossible numbers.

Business Areas:
Database Data and Analytics, Software

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.

Country of Origin
🇨🇦 Canada

Page Count
7 pages

Category
Computer Science:
Logic in Computer Science