Searcharxiv⌕ 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 $\mu$ satisfying $\mu(x, y, y) = \mu(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

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

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗