Abstract
In this article, we investigate the status of the homomorphism preservation property amongst restricted classes of finite relational structures and algebraic structures. We show that there are many homomorphism-closed classes of finite lattices that are definable by a first-order sentence but not by existential positive sentences, demonstrating the failure of the homomorphism preservation property for lattices at the finite level. In contrast to the negative results for algebras, we establish a finite-level relativised homomorphism preservation theorem in the relational case. More specifically, we give a complete finite-level characterisation of first-order definable finitely generated anti-varieties relative to classes of relational structures definable by sentences of some general forms. When relativisation is dropped, this gives a fresh proof of Atserias’s characterisation of first-order definable constraint satisfaction problems over a fixed template, a well known special case of Rossman’s Finite Homomorphism Preservation Theorem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ajtai, M., and Y. Gurevich, Monotone versus positive. J. Assoc. Comput. Mach. 34(4):1004–1015, 1987.
Atserias, A., On digraph coloring problems and treewidth duality. European J. Combin. 29(4):796–820, 2008.
Atserias, A., A. Dawar, and M. Grohe, Preservation under extensions on well-behaved finite structures. SIAM J. Comput. 38(4):1364–1381, 2008.
Atserias, A., A. Dawar, and P. G. Kolaitis, On preservation under homomorphisms and unions of conjunctive queries. J. ACM 53(2):208–237 (electronic), 2006.
Clark, D. M., B. A. Davey, M. G. Jackson, and J. G. Pitkethly, The axiomatizability of topological prevarieties. Adv. Math. 218(5):1604–1653, 2008.
Feder, T., and M. Y. Vardi, The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. Comput. 28(1):57–104 (electronic), 1999.
Gorbunov, V. A., Algebraic Theory of Quasivarieties. Siberian School of Algebra and Logic. Consultants Bureau, New York, 1998. Translated from the Russian.
Gurevich, Y., Toward logic tailored for computational complexity. In Computation and proof theory (Aachen, 1983), volume 1104 of Lecture Notes in Math., pp. 175–216. Springer, Berlin, 1984.
Hodges, W., A Shorter Model Theory. Cambridge University Press, 1997.
Jackson, M., and B. Trotta, Constraint satisfaction, irredundant axiomatisability and continuous colouring. Studia Logica 101(1):65–94, 2013.
Larose, B., C. Loten, and C. Tardif, A characterisation of first-order constraint satisfaction problems. Log. Methods Comput. Sci. 3(4–6):1–22, 2007.
Libkin, L., Elements of Finite Model Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, 2004.
Rossman, B., Homomorphism preservation theorems. J. ACM 55(3):1–53, 2008.
Tait, W. W., A counterexample to a conjecture of Scott and Suppes. J. Symb. Logic 24:15–16, 1959.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ham, L. Relativised Homomorphism Preservation at the Finite Level. Stud Logica 105, 761–786 (2017). https://doi.org/10.1007/s11225-017-9710-7
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11225-017-9710-7