Abstract
We start this chapter by giving a few examples of inexpressibility proofs, using the standard model-theoretic machinery (compactness, the Löwenheim-Skolern theorem). We then show that this machinery is not generally applicable in the finite model theory context, and introduce the notion of Ehrenfeucht-Fraïssé games for first-order logic. We prove the EhrenfeuchtFraïssé theorem, characterizing the expressive power of FO via games, and introduce the notion of types, which will be central throughout the book.
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.
Bibliographic Notes
J. Väänänen. A Short Course in Finite Model Theory. University of Helsinki. 44pp. Available at www.math.helsinki.fi/logic/people/jouko.vaananen.
H. Gaifman and M.Y. Vardi. A simple proof that connectivity is not first-order definable. Bulletin of the EATCS, 26 (1985), 43–45.
R. Fräissé. Sur quelques classifications des systèmes de relations. Université d’Alger, Publications Scientifiques, Série A, 1 (1954), 35–182.
A. Ehrenfeucht. An application of games to the completeness problem for formalized theories. Fundamenta Mathematicae, 49 (1961), 129–141.
Y. Gurevich. Logic and the challenge of computer science. In Current trends in theoretical computer science, E. Börger, ed., Computer Science Press, 1988, pages 1–57.
J. Rosenstein. Linear Orderings. Academic Press, 1982.
Y. Gurevich. Logic and the challenge of computer science. In Current trends in theoretical computer science, E. Börger, ed., Computer Science Press, 1988, pages 1–57.
H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995.
N. Immerman. Descriptive Complexity. Springer-Verlag, 1998.
C.C. Chang and H.J. Keisler. Model Theory. North-Holland, 1990.
W. Hodges. Model Theory. Cambridge University Press, 1993.
B. Poizat. A Course in Model Theory: An Introduction to Contemporary Mathematical Logic. Springer-Verlag, 2000.
H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995.
W. Hodges. Model Theory. Cambridge University Press, 1993.
Y. Gurevich. Toward logic tailored for computational complexity. In Computation and Proof Theory, M. Richter et al., eds., Springer Lecture Notes in Mathematics, Vol. 1104, 1984, pages 175–216.
E. Rosen. Some aspects of model theory and finite structures. Bulletin of Symbolic Logic, 8 (2002), 380–403.
E. Rosen and S. Weinstein. Preservation theorems in finite model theory. In Logic and Computational Complexity, Springer-Verlag LNCS 960, 1994, pages 480–502.
T. Feder and M.Y. Vardi. Homomorphism closed vs. existential positive. IEEE Symp. on Logic in Computer Science, 2003, pages 311–320.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Libkin, L. (2004). Ehrenfeucht-Fraïssé Games. In: Elements of Finite Model Theory. Texts in Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-07003-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-07003-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05948-3
Online ISBN: 978-3-662-07003-1
eBook Packages: Springer Book Archive