The expressive power of CSP-quantifiers

DOI10.4230/LIPICS.CSL.2023.25MaRDI QIDQ6610628zbMATH OpenFDO

Authors Lauri Hella

Publication date 25 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CSL.2023.25

zbMATH Keywords

constraint satisfaction problemsdescriptive complexity theoryfinite variable logicsgeneralized quantifierspebble games

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cited in

(3)

• Limitations of game comonads for invertible-map equivalence via homomorphism indistinguishability
• Quantifiers closed under partial polymorphisms
• Linear algebraic quantifiers

This page was built for publication: The expressive power of CSP-quantifiers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6610628)