Ehrenfeucht-Fraisse games are a useful technique for proving inexpressibility results in first-order logic. Strategies for a few basic games (on long paths, set-powerset structures and random graphs, to name a few) can be used as a building blocks for strategies in more complicated games. In this talk, I will discuss a few general methods for combining strategies. Applications include results on the expressive power of successor-invariant logic and k-variable logic.
['Benjamin Rossman']
Combining Ehrenfeucht-Fraïssé Games