Skip to main content

Ehrenfeucht-Fraïssé Games

  • Reference work entry
  • First Online:
  • 39 Accesses

Synonyms

EF-games; Ehrenfeucht games

Definition

The Ehrenfeucht-Fraïssé game (EF-game, for short) is played by two players, usually called the spoiler and the duplicator (in the literature, the two players are sometimes also called Samson and Delilah or, simply, player I and player II). The board of the game consists of two structures 𝒜 and ℬ of the same vocabulary. The spoiler’s intention is to show a difference between the two structures, while the duplicator tries to make them look alike.

The rules of the classical EF-game are as follows: The players play a certain number r of rounds. Each round i consists of two steps. First, the spoiler chooses either an element ai in the universe of 𝒜 or an element bi in the universe of ℬ. Afterwards, the duplicator chooses an element in the other structure, i.e., she chooses an element bi in the universe of ℬ if the spoiler’s move was in 𝒜, respectively, an element ai in the universe of 𝒜 if the spoiler’s move was in ℬ.

After rrounds, the...

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   6,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Recommended Reading

  1. Ehrenfeucht A. An application of games to the completeness problem for formalized theories. Fundam Math. 1961;49(2):129–41.

    Article  MathSciNet  MATH  Google Scholar 

  2. Fagin R. Easier ways to win logical games. In: Immerman N, Kolaitis PG, editors. Descriptive complexity and finite models, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 31. Providence: American Mathematical Society; 1997. p. 1–32.

    Google Scholar 

  3. Fraïssé R. Sur quelques classifications des systèmes de relations. Université d’Alger, Publications Scientifiques; 1954, SérieA(1):35–182.

    Google Scholar 

  4. Libkin L. Elements of finite model theory. Berlin: Springer; 2004.

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nicole Schweikardt .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Schweikardt, N. (2018). Ehrenfeucht-Fraïssé Games. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_1271

Download citation

Publish with us

Policies and ethics