paperbot · PL 论文追踪

RSS

Constraint satisfaction problems, compactness and non-measurable sets

LMCS vol.Volume 22, Issue 32026
Claude Tardif

尚未生成 AI 速览(可能缺少 API key 或等待下次运行补跑)。

原文摘要(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.

链接与引用

DOI 原文 ·

BibTeX
@article{paperbot3971,
  title = {Constraint satisfaction problems, compactness and non-measurable sets},
  author = {Claude Tardif},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 22, Issue 3},
  year = {2026},
  doi = {10.46298/lmcs-22(3:1)2026}
}