An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
Logic in Computer Science
2015-07-01 v3 Computational Complexity
Logic
Abstract
We prove an algebraic preservation theorem for positive Horn definability in aleph-zero categorical structures. In particular, we define and study a construction which we call the periodic power of a structure, and define a periomorphism of a structure to be a homomorphism from the periodic power of the structure to the structure itself. Our preservation theorem states that, over an aleph-zero categorical structure, a relation is positive Horn definable if and only if it is preserved by all periomorphisms of the structure. We give applications of this theorem, including a new proof of the known complexity classification of quantified constraint satisfaction on equality templates.
Keywords
Cite
@article{arxiv.1207.6696,
title = {An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction},
author = {Hubie Chen and Moritz Müller},
journal= {arXiv preprint arXiv:1207.6696},
year = {2015}
}