Abstract
Abstract
A game that characterizes equivalence of structures with respect to all first-order sentences containing a given number of quantifiers was introduced by Immerman in 1981. We define three other games and prove that they are all equivalent to the Immerman game, and hence also give a characterization for the number of quantifiers needed for separating structures. In the Immerman game, Duplicator has a canonical optimal strategy, and hence Duplicator can be completely removed from the game by replacing her moves with default moves given by this optimal strategy. On the other hand, in the last two of our games there is no such optimal strategy for Duplicator. Thus, the Immerman game can be regarded as a one-player game, but two of our games are genuine two-player games.
Publisher
Cambridge University Press (CUP)
Reference20 articles.
1. The Size of a Formula as a Measure of Complexity
2. Die Widerspruchsfreiheit der allgemeinen Mengenlehre
3. van der Hoek, W. and Iliev, P. (2014). On the relative succinctness of modal logics with union, intersection and quantification. In: Bazzan, A. L. C. , Huhns, M. N. , Lomuscio, A. and Scerri, P. (eds.) International conference on Autonomous Agents and Multi-Agent Systems, AAMAS’14, Paris, France, May 5–9, 2014, IFAAMAS/ACM, 341–348. URL http://dl.acm.org/citation.cfm?id=2615788.
4. Applications of matrix methods to the theory of lower bounds in computational complexity