Skip to main content
SpringerLink
Log in

Locality of order-invariant first-order formulas

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1998 (MFCS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1450))

Abstract

A query is local if the decision of whether a tuple in a structure satisfies this query only depends on a small neighborhood of the tuple. We prove that all queries expressible by order-invariant first-order formulas are local.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

    Google Scholar 

  2. O. Belegradek, A. Stolboushkin, and M. Taitslin. Extended order-generic queries, 1997. Submitted for publication.

    Google Scholar 

  3. G. Dong, L. Libkin, and L. Wong. Local properties of query languages. In Proceedings of the 6th International Conference on Database Theory, volume 1186 of Lecture Notes in Computer Science, pages 140–154. Springer-Verlag, 1997.

    Google Scholar 

  4. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995.

    Google Scholar 

  5. H. Gaifman. On local and non-local properties. In Proceedings of the Herbrand Symposium, Logic Colloquium '81. North Holland, 1982.

    Google Scholar 

  6. Y. Gurevich. Private communication.

    Google Scholar 

  7. L. Hella. Private communication.

    Google Scholar 

  8. L. Hella, L. Libkin, and Y. Nurmonen. Notions of locality and their logical characterizations over finite models, 1998. unpublished.

    Google Scholar 

  9. L. Libkin. On forms of locality over finite models. In Proceedings of the 12th IEEE Symposium on Logic in Computer Science, pages 204–215, 1997.

    Google Scholar 

  10. L. Libkin. On counting and local properties. To appear in Proceedings of the 13th IEEE Symposium on Logic in Computer Science, 1998.

    Google Scholar 

  11. T. Schwentick. Graph connectivity and monadic NP. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pages 614–622, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für mathematische Logik, Eckerstr. 1, 79104, Freiburg, Germany

    Martin Grohe

  2. Institut für Informatik, Johannes-Gutenberg-Universität Mainz, 55099, Mainz, Germany

    Thomas Schwentick

Authors
  1. Martin Grohe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Schwentick
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luboš Brim Jozef Gruska Jiří Zlatuška

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grohe, M., Schwentick, T. (1998). Locality of order-invariant first-order formulas. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055793

Download citation

  • DOI: https://doi.org/10.1007/BFb0055793

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64827-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation