Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.33873

Compactness Principles for CSPs and the Axiom of Chocie

Anthony Li·Ishin Shan·Matthew Snodgrass·Riley Thornton·Rui Zhou
View original source ↗Read source document ↗Export metadata ↓

Abstract

We can associate a compactness principle $\mathcal K_{\mathcal{D}}$ to the Constraint Satisfaction Problem (CSP) with constraint library $\mathcal{D}$. These principles were studied by Katáy, Tóth, and Vidnyánszky and by Rorabaugh, Tardif, and Wehlau. We expand their work comparing the strength of $K_{\mathcal{D}}$ for varying structures $\mathcal{D}$. We characterize the structures whose compactness principles are provable from ZF; these turn out to be the width-1 structures. We compare some important compactness principles, namely those of $2\text{SAT}$, $3\text{LIN}2$, and $K_2$, settling a question of Katáy, Tóth, and Vidnyánszky. And, we find an infinite chain and an infinite anti-chain of compactness principles related to directed cycles and finite choice.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anthony Li, Ishin Shan, Matthew Snodgrass, Riley Thornton, Rui Zhou. 2026-09-27. Compactness Principles for CSPs and the Axiom of Chocie. https://arxiv.org/abs/2609.33873

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Freely adding one layer of quantifiers to a Boolean doctrine

We describe the layer of quantifier alternation depth at most one of the quantifier completion of a Boolean doctrine over a small category. This amounts to a doctrinal version of Herbrand's theorem for formulas with quantifier alternation depth at most one modulo a universal theory. The resulting construction satisfies a universal property that makes it the free QA-one-step Boolean doctrine. To achieve this version of Herbrand's theorem, we characterize, within the doctrinal setting, the classes $A$ of quantifier-free formulas for which there is a model $M$ such that $A$ is precisely the class of formulas whose universal closure is valid in $M$.

math.LO↗
arXiv2026

Generalized Borel Sets

Generalizing classical descriptive set theory opens foundational questions about the Borel hierarchy. In this paper we systematically study those questions, working in the general framework of Polish-like spaces relative to an uncountable cardinal $κ$, possibly singular, satisfying $2^{<κ}=κ$. We provide fundamental properties of the $κ^+$-Borel hierarchy of any regular Hausdorff space of weight at most $κ$, and establish sufficient conditions for its non-collapse. We highlight a unique phenomenon that arises in the case of singular cardinals, namely, the existence of a second, distinct Borel hierarchy, the $κ$-Borel hierarchy: we prove that it is strictly finer than the $κ^+$-Borel hierarchy, and then characterize the precise relationship between the two. Finally, for regular cardinals, we resolve three questions about the behavior of the $κ^+$-Borel hierarchy on subspaces of the generalized Baire space ${}^κκ$, constructing various models via forcing where several nontrivial constellations for the length of the $κ^+$-Borel hierarchy on the space are realized.

math.LO↗
arXiv2026

The complexity of being monitorable

We study monitorable sets from a topological standpoint. In particular, we use descriptive set theory to describe the complexity of the family of monitorable sets in a countable space $X$. When $X$ is second countable, we observe that the family of monitorable sets is $Π^0_3$ and determine the exact complexities it can have. In contrast, we show that if $X$ is not second countable then the family of monitorable sets can be much more complex, giving an example where it is $ Π^1_1$-complete.

math.LO↗