A New Ehrenfeucht-Fraïssé Game for Dependence Logic
This provides a more accessible game-theoretic characterization of dependence logic for logicians, though it is an incremental improvement over existing team-based games.
The authors introduce a new Ehrenfeucht-Fraïssé game for dependence logic that uses single-element moves instead of team moves, simplifying the game while preserving its ability to characterize elementary equivalence.
We define a new Ehrenfeucht-Fraïssé game for dependence logic. The previously known rendition of such a game was based on moves that are teams. Since teams can be massive, making team moves may be quite complicated. To remedy this, our new Ehrenfeucht-Fraïssé game for dependence logic has only moves that consist of single elements, as in the classical Ehrenfeucht-Fraïssé game of first order logic. A new feature of the game is that a player can declare that their move is made on the basis of certain previous moves only and thereby in a sense independent of other moves. We show that our game characterizes elementary equivalence in dependence logic.