Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.00396

Proof complexity of Mal'tsev CSP

Azza Gaysin
View original source ↗Read source document ↗Export metadata ↓

Abstract

Constraint Satisfaction Problems (CSPs) form a broad class of combinatorial problems, which can be formulated as homomorphism problems between relational structures. The CSP dichotomy theorem classifies all such problems over finite domains into two categories: NP-complete and polynomial-time, see Zhuk (2017), Bulatov (2017). Polynomial-time CSPs can be further subdivided into smaller subclasses. Mal'tsev CSPs are defined by the property that every relation in the problem is invariant under a Mal'tsev operation, a ternary operation $μ$ satisfying $μ(x, y, y) = μ(y, y, x) = x$ for all $x, y$. Bulatov and Dalmau proved that Mal'tsev CSPs are solvable in polynomial time, presenting an algorithm for such CSPs (2006). The negation of an unsatisfiable CSP instance can be expressed as a propositional tautology. We formalize the algorithm for Mal'tsev CSPs within bounded arithmetic $V^1$, which captures polynomial-time reasoning and corresponds to the extended Frege proof system. We show that $V^1$ proves the soundness of Mal'tsev algorithm, implying that tautologies expressing the non-existence of a solution for unsatisfiable instances of Mal'tsev CSPs admit short extended Frege proofs. In addition, with small adjustments, we achieved an analogous result for Dalmau's algorithm that solves generalized majority-minority CSPs -- a common generalization of near-unanimity operations and Mal'tsev operations.

Explore related subjects

math.LOcs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Azza Gaysin. 2025-08-01. Proof complexity of Mal'tsev CSP. https://arxiv.org/abs/2508.00396

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

KEEP EXPLORING

Related papers

arXiv2026

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO↗
arXiv2026

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO↗
arXiv2026

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO↗