Repository logo
 

Arity Hierarchies for Quantifiers Closed Under Partial Polymorphisms

Published version
Peer-reviewed

Repository DOI


Change log

Abstract

We investigate the expressive power of generalized quantifiers closed under partial polymorphism conditions motivated by the study of constraint satisfaction problems. We answer a number of questions arising from the work of Dawar and Hella (CSL 2024) where such quantifiers were introduced. For quantifiers closed under partial near-unanimity polymorphisms, we establish hierarchy results clarifying the interplay between the arity of the polymorphisms and of the quantifiers: The expressive power of (𝓁+1)-ary quantifiers closed under 𝓁-ary partial near-unanimity polymorphisms is strictly between the class of all quantifiers of arity 𝓁-1 and 𝓁. We also establish an infinite hierarchy based on the arity of quantifiers with a fixed arity of partial near-unanimity polymorphisms. Finally, we prove inexpressiveness results for quantifiers with a partial Maltsev polymorphism. The separation results are proved using novel algebraic constructions in the style of Cai-Fürer-Immerman and the quantifier pebble games of Dawar and Hella (2024).

Description

Keywords

Journal Title

34th EACSL Annual Conference on Computer Science Logic (CSL 2026)

Conference Name

Computer Science Logic 2026

Journal ISSN

Volume Title

363

Publisher

Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Rights and licensing

Except where otherwised noted, this item's license is described as Attribution 4.0 International
Sponsorship
Horizon Europe UKRI Underwrite ERC (EP/X028259/1)