Skip to main content
SpringerLink
Log in
SpringerLink
Log in

The Past and Future of Embedded Finite Model Theory

  • Conference paper
  • First Online:
Reachability Problems (RP 2022)

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

Included in the following conference series:

  • 223 Accesses

Abstract

Embedded finite model theory refers to a formalism for describing finite structures over an uninterpreted signature, which sit within an infinite interpreted structures. Some theory was developed in the 1990s and early 2000s, with a focus on the real field. But the theory applies to arbitrary theories, and is relevant to recent development on graph querying and analysis of data-driven programs involving arithmetic.

In this invited paper we review the framework and some of the basic results on it. We also discuss some open questions, along with some work in progress, joint with Ehud Hrushovski.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ax, J.: The elemenentary theory of finite field. Ann. Math. 88(2), 293–271 (1968)

    Article  MathSciNet  Google Scholar 

  2. Baldwin, J., Benedikt, M.: Stability theory, permutations of indiscernibles, and embedded finite models. Trans. Am. Math. Soc. 352, 4937–4969 (2000)

    Google Scholar 

  3. Basu, S.: New results on quantifier elimination over real closed fields and applications to constraint databases. J. ACM 46(4), 537–555 (1999)

    Article  MathSciNet  Google Scholar 

  4. Belegradek, O.V., Stolboushkin, A.P., Taitslin, M.A.: Extended order-generic queries. Ann. Pure Appl. Logic 97(1–3), 85–125 (1999)

    Article  MathSciNet  Google Scholar 

  5. Benedikt, M.: Generalizing finite model theory. In: Logic Colloquium 2003, pp. 3–24. Cambridge University Press, London (2006)

    Google Scholar 

  6. Benedikt, M., Hrushovski, E.: Embedded finite model theory notes (2022). Manuscript

    Google Scholar 

  7. Benedikt, M., Kuijpers, B., Löding, C., Van den Bussche, J., Wilke, T.: A characterization of first-order topological properties of planar spatial data. J. ACM 53(2), 273–305 (2006)

    Article  MathSciNet  Google Scholar 

  8. Benedikt, M., Libkin, L.: Relational queries over interpreted structures. J. ACM 47(4), 644–680 (2000)

    Article  MathSciNet  Google Scholar 

  9. Benedikt, M., Libkin, L., Schwentick, T., Segoufin, L.: Definable relations and first-order query languages over strings. J. ACM 50(5), 694–751 (2003)

    Article  MathSciNet  Google Scholar 

  10. Calvanese, D., De Giacomo, G., Montali, M.: Foundations of data-aware process analysis: a database theory perspective. In: PODS (2013)

    Google Scholar 

  11. Chang, C.C., Keisler. H.J.: Model Theory. North-Holland, New York (1990)

    Google Scholar 

  12. van den Dries, L.P.D.: Tame Topology and O-minimal Structures. Cambridge University Press, London (1998)

    Google Scholar 

  13. Figueira, D., Jez, A., Lin, A.W.: Data path queries over embedded graph databases. In: PODS (2022)

    Google Scholar 

  14. Flum, J., Ziegler, M.: Pseudo-finite homogeneïty and saturation. J. Symbol. Logic 64(4), 1689–1699 (1999)

    Article  Google Scholar 

  15. Grohe, M., Segoufin, L.: On first-order topological queries. ACM Trans. Comput. Log. 3(3), 336–358 (2002)

    Article  MathSciNet  Google Scholar 

  16. Gurfinkel, A.: Program verification with constrained horn clauses. In: CAV (2022)

    Google Scholar 

  17. Hull, R., Su, J.: Domain independence and the relational calculus. Acta Informatica, 31, 512–524 (1994)

    Google Scholar 

  18. Kanellakis, P.C., Kuper, G.M., Revesz, P.Z.: Constraint query languages. J. Comput. Syst. Sci. 51(1), 26–52 (1995)

    Article  MathSciNet  Google Scholar 

  19. Libkin, L.: Embedded finite models and constraint databases. In: Finite Model Theory and Its Applications, pp. 257–337. Springer, Heidelberg (2007). https://doi.org/10.1007/3-540-68804-8_5

  20. Paredaens, J., Van den Bussche, J., Van Gucht, D.: First-order queries on finite structures over the reals. SIAM J. Comput. 27(6), 1747–1763 (1998)

    Article  MathSciNet  Google Scholar 

  21. Simon, P.: Distal and non-distal nip theories. Ann. Pure Appl. Logic 164(3), 294–318 (2013)

    Article  MathSciNet  Google Scholar 

  22. Simon, P.: A Guide to NIP Theories. Cambridge University Press, UK (2015)

    Google Scholar 

  23. Wagner, P.: Simple theories. Kluwer, Dordrecht (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Oxford University, Oxford, UK

    Michael Benedikt

Authors
  1. Michael Benedikt
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michael Benedikt .

Editor information

Editors and Affiliations

  1. Department of Computer Science, TU Kaiserslautern, Kaiserslautern, Germany

    Anthony W. Lin

  2. Max Planck Institute for Software Systems, Kaiserslautern, Germany

    Georg Zetzsche

  3. University of Liverpool, Liverpool, UK

    Igor Potapov

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Benedikt, M. (2022). The Past and Future of Embedded Finite Model Theory. In: Lin, A.W., Zetzsche, G., Potapov, I. (eds) Reachability Problems. RP 2022. Lecture Notes in Computer Science, vol 13608. Springer, Cham. https://doi.org/10.1007/978-3-031-19135-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-19135-0_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-19134-3

  • Online ISBN: 978-3-031-19135-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation