Abstract
We present a logic-based combinatorial property of classes of finite structures that allows an effective generalization of the Łoś-Tarski preservation theorem to hold over classes satisfying the property. The well-studied classes of words and trees, and structures of bounded tree-depth are shown to satisfy the property. We also show that starting with classes satisfying this property, the classes generated by applying composition operations like disjoint union, cartesian and tensor products, inherit the property. We finally show that all classes of structures that are well-quasi-ordered under the embedding relation satisfy a natural generalization of our property.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Atserias, A., Dawar, A., Grohe, M.: Preservation under extensions on well-behaved finite structures. SIAM J. Comput. 38(4), 1364–1381 (2008)
Atserias, A., Dawar, A., Kolaitis, P.G.: On preservation under homomorphisms and unions of conjunctive queries. J. ACM 53(2), 208–237 (2006)
Chang, C.C., Keisler, H.J.: Model Theory, 3rd edn. Elsevier Science Publishers (1990)
Diestel, R.: Graph Theory. Springer (2010)
Duris, D.: Extension preservation theorems on classes of acyclic finite structures. SIAM J. Comput. 39(8), 3670–3681 (2010)
Harwath, F., Heimberg, L., Schweikardt, N.: Preservation and decomposition theorems for bounded degree structures. In: Proc. of CSL-LICS (2014)
Libkin, L.: Elements of Finite Model Theory. Springer (2004)
Makowsky, J.A.: Algorithmic uses of the Feferman-Vaught theorem. Ann. Pure Appl. Logic 126(1-3), 159–213 (2004)
Nesetril, J., de Mendez, P.O.: Tree-depth, subgraph coloring and homomorphism bounds. Eur. J. Comb. 27(6), 1022–1041 (2006)
Sankaran, A., Adsul, B., Chakraborty, S.: Generalizations of the Łoś-Tarski preservation theorem. CoRR, abs/1302.4350 (2013)
Sankaran, A., Adsul, B., Madan, V., Kamath, P., Chakraborty, S.: Preservation under substructures modulo bounded cores. In: Ong, L., de Queiroz, R. (eds.) WoLLIC 2012. LNCS, vol. 7456, pp. 291–305. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Sankaran, A., Adsul, B., Chakraborty, S. (2014). A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds) Mathematical Foundations of Computer Science 2014. MFCS 2014. Lecture Notes in Computer Science, vol 8634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44522-8_40
Download citation
DOI: https://doi.org/10.1007/978-3-662-44522-8_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44521-1
Online ISBN: 978-3-662-44522-8
eBook Packages: Computer ScienceComputer Science (R0)