Skip to main content

Preservation Under Extensions on Well-Behaved Finite Structures

  • Conference paper
Automata, Languages and Programming (ICALP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3580))

Included in the following conference series:

Abstract

A class of relational structures is said to have the extension preservation property if every first-order sentence that is preserved under extensions on the class is equivalent to an existential sentence. The class of all finite structures does not have the extension preservation property. We study the property on classes of finite structures that are better behaved. We show that the property holds of classes of acyclic structures, structures of bounded degree and more generally structures that are wide in a sense we make precise. We also show that the preservation property holds for the class of structures of treewidth at most k, for any k. In contrast, we show that the property fails for the class of planar graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Atserias, A., Dawar, A., Kolaitis, P.G.: On preservation under homomorphisms and unions of conjunctive queries. In: Proc. 23rd ACM Symp. on Principles of Database Systems, pp. 319–329 (2004)

    Google Scholar 

  2. Downey, R.G., Fellows, M.R.: Parametrized Complexity. Springer, Heidelberg (1999)

    Google Scholar 

  3. Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  4. Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical Logic, 2nd edn. Springer, Heidelberg (1994)

    MATH  Google Scholar 

  5. Grohe, M., Flum, J., Frick., M.: Query evaluation via tree-decompositions. Journal of the ACM 49, 716–752 (2002)

    Article  MathSciNet  Google Scholar 

  6. Gurevich, Y.: Toward logic tailored for computational complexity. In: Richter, M. (ed.) Computation and Proof Theory. Lecture Notes in Mathematics, pp. 175–216. Springer, Heidelberg (1984)

    Chapter  Google Scholar 

  7. Hodges, W.: Model Theory. Cambridge University Press, Cambridge (1993)

    Book  MATH  Google Scholar 

  8. Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  9. Tait, W.W.: A counterexample to a conjecture of Scott and Suppes. Journal of Symbolic Logic 24, 15–16 (1959)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Atserias, A., Dawar, A., Grohe, M. (2005). Preservation Under Extensions on Well-Behaved Finite Structures. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_116

Download citation

  • DOI: https://doi.org/10.1007/11523468_116

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27580-0

  • Online ISBN: 978-3-540-31691-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics