The Ehrenfeucht-Fraisse Theorem describes a back-and-forth game, with the back-and-forth method introduced by Roland Fraisse and formulated as a game by Andrzej Ehrenfeucht, used to determine whether two mathematical structures are elementarily equivalent, meaning they satisfy exactly the same first-order sentences. Two players, conventionally called Spoiler and Duplicator, alternately choose elements from each structure, and the theorem states that Duplicator has a winning strategy in the game of every finite length exactly when the two structures are elementarily equivalent, making the game one of the principal tools for proving that certain properties cannot be expressed in first-order logic.
Facts
StatementTwo structures A and B are elementarily equivalent, meaning they satisfy exactly the same first-order sentences, if and only if the Duplicator player has a winning strategy in the Ehrenfeucht-Fraisse game of every finite length n played between A and B, provided the underlying vocabulary of relation symbols is finite. 1 Classification
Statement FormCharacterization Theorem 1 Connections
Has Statement Form
In Branch
Source Ehrenfeucht-Fraisse game, Wikipedia
Sources
1. Ehrenfeucht-Fraisse game, Wikipedia
Equivalence and inexpressibility section
It is easy to prove that if Duplicator wins this game for all finite n, that is, A ∼ B, then A and B are elementarily equivalent.
References
An application of games to the completeness problem for formalized theories, A. Ehrenfeucht, Fundamenta Mathematicae 49 (1961), 129-141.
In Group: Mathematical Logic and Model Theory, Article text
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.
- In Branch: Model Theory, Lead sentence
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.