Ehrenfeucht–Fraïssé game

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Template:Short description In the mathematical discipline of model theory, the Ehrenfeucht–Fraïssé game (also called back-and-forth games) is a technique based on game semantics for determining whether two structures are elementarily equivalent. The main application of Ehrenfeucht–Fraïssé games is in proving the inexpressibility of certain properties in first-order logic. Indeed, Ehrenfeucht–Fraïssé games provide a complete methodology for proving inexpressibility results for first-order logic. In this role, these games are of particular importance in finite model theory and its applications in computer science (specifically computer aided verification and database theory), since Ehrenfeucht–Fraïssé games are one of the few techniques from model theory that remain valid in the context of finite models. Other widely used techniques for proving inexpressibility results, such as the compactness theorem, do not work in finite models.

Ehrenfeucht–Fraïssé-like games can also be defined for other logics, such as fixpoint logics<ref>Template:Cite book</ref> and pebble games for finite variable logics; extensions are powerful enough to characterise definability in existential second-order logic.

Main idea

The main idea behind the game is that we have two structures, and two players – Spoiler and Duplicator. Duplicator wants to show that the two structures are elementarily equivalent (satisfy the same first-order sentences), whereas Spoiler wants to show that they are different. The game is played in rounds. A round proceeds as follows: Spoiler chooses any element from one of the structures, and Duplicator chooses an element from the other structure. In simplified terms, the Duplicator's task is to always pick an element "similar" to the one that the Spoiler has chosen, whereas the Spoiler's task is to choose an element for which no "similar" element exists in the other structure. Duplicator wins if there exists an isomorphism between the eventual substructures chosen from the two different structures; otherwise, Spoiler wins.

The game lasts for a fixed number of steps <math>\gamma</math> (which is an ordinal – usually a finite number or <math>\omega</math>).

Definition

Suppose that we are given two structures <math>\mathfrak{A}</math> and <math>\mathfrak{B}</math>, each with no function symbols and the same set of relation symbols, and a fixed natural number n. We can then define the Ehrenfeucht–Fraïssé game <math>G_n(\mathfrak{A},\mathfrak{B})</math> to be a game between two players, Spoiler and Duplicator, played as follows:

  1. The first player, Spoiler, picks either a member <math>a_1</math> of <math>\mathfrak{A}</math> or a member <math>b_1</math> of <math>\mathfrak{B}</math>.
  2. If Spoiler picked a member of <math>\mathfrak{A}</math>, Duplicator picks a member <math>b_1</math> of <math>\mathfrak{B}</math>; otherwise, Duplicator picks a member <math>a_1</math> of <math>\mathfrak{A}</math>.
  3. Spoiler picks either a member <math>a_2</math> of <math>\mathfrak{A}</math> or a member <math>b_2</math> of <math>\mathfrak{B}</math>.
  4. Duplicator picks an element <math>a_2</math> or <math>b_2</math> in the model from which Spoiler did not pick.
  5. Spoiler and Duplicator continue to pick members of <math>\mathfrak{A}</math> and <math>\mathfrak{B}</math> for <math>n-2</math> more steps.
  6. At the conclusion of the game, we have chosen distinct elements <math>a_1, \dots, a_n</math> of <math>\mathfrak{A}</math> and <math>b_1, \dots, b_n</math> of <math>\mathfrak{B}</math>. We therefore have two structures on the set <math>\{1, \dots,n\}</math>, one induced from <math>\mathfrak{A}</math> via the map sending <math>i</math> to <math>a_i</math>, and the other induced from <math>\mathfrak{B}</math> via the map sending <math>i</math> to <math>b_i</math>. Duplicator wins if these structures are the same; Spoiler wins if they are not.

For each n we define a relation <math>\mathfrak{A} \ \overset{n}{\sim}\ \mathfrak{B}</math> if Duplicator wins the n-move game <math>G_n(\mathfrak{A},\mathfrak{B})</math>. These are all equivalence relations on the class of structures with the given relation symbols. The intersection of all these relations is again an equivalence relation <math>\mathfrak{A} \sim \mathfrak{B}</math>.

Equivalence and inexpressibility

It is easy to prove that if Duplicator wins this game for all finite n, that is, <math>\mathfrak{A} \sim \mathfrak{B}</math>, then <math>\mathfrak{A}</math> and <math>\mathfrak{B}</math> are elementarily equivalent. If the set of relation symbols being considered is finite, the converse is also true.

If a property <math>Q</math> is true of <math>\mathfrak{A}</math> but not true of <math>\mathfrak{B}</math>, but <math>\mathfrak{A}</math> and <math>\mathfrak{B}</math> can be shown equivalent by providing a winning strategy for Duplicator, then this shows that <math>Q</math> is inexpressible in the first-order logic of structures with the given relation symbols.

History

The back-and-forth method used in the Ehrenfeucht–Fraïssé game to verify elementary equivalence was given by Roland Fraïssé in his thesis;<ref>Sur une nouvelle classification des systèmes de relations, Roland Fraïssé, Comptes Rendus 230 (1950), 1022–1024.</ref><ref>Sur quelques classifications des systèmes de relations, Roland Fraïssé, thesis, Paris, 1953; published in Publications Scientifiques de l'Université d'Alger, series A 1 (1954), 35–182.</ref> it was formulated as a game by Andrzej Ehrenfeucht.<ref>An application of games to the completeness problem for formalized theories, A. Ehrenfeucht, Fundamenta Mathematicae 49 (1961), 129–141.</ref> The names Spoiler and Duplicator are due to Joel Spencer.<ref>Stanford Encyclopedia of Philosophy, entry on Logic and Games.</ref> Other usual names are Eloise [sic] and Abelard (and often denoted by <math>\exists</math> and <math>\forall</math>) after Heloise and Abelard, a naming scheme introduced by Wilfrid Hodges in his book Model Theory, or alternatively Eve and Adam.

Further reading

Chapter 1 of Poizat's model theory text<ref>A Course in Model Theory, Bruno Poizat, tr. Moses Klein, New York: Springer-Verlag, 2000.</ref> contains an introduction to the Ehrenfeucht–Fraïssé game, and so do Chapters 6, 7, and 13 of Rosenstein's book on linear orders.<ref>Linear Orderings, Joseph G. Rosenstein, New York: Academic Press, 1982.</ref> A simple example of the Ehrenfeucht–Fraïssé game is given in one of Ivars Peterson's MathTrek columns.<ref>Example of the Ehrenfeucht-Fraïssé game.</ref>

Phokion Kolaitis' slides<ref>Course on combinatorial games in finite model theory by Phokion Kolaitis (.ps file)</ref> and Neil Immerman's book chapter<ref name="Immerman1999">Template:Cite book</ref> on Ehrenfeucht–Fraïssé games discuss applications in computer science, the methodology for proving inexpressibility results, and several simple inexpressibility proofs using this methodology.

Ehrenfeucht–Fraïssé games are the basis for the operation of derivative on modeloids. Modeloids are certain equivalence relations and the derivative provides for a generalization of standard model theory.

References

<references />

Retrieved from "https://wiki.sarg.dev/index.php?title=Ehrenfeucht–Fraïssé_game&oldid=611321"