Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite Structures
We show that deciding the winner of the r-moves Ehrenfeucht-Fraïssé game on two finite structures A and B, over any fixed signature Σ that contains at least one binary and one ternary relation, is PSPACE complete. We consider two natural modifications of the EF game, the one-sided r-moves EF game, where the spoiler can choose from the first structure A only, and therefore the duplicator wins only if B satisfies all the existential formulas of rank at most r that A satisfies; and the k-alternations r-moves EF game (for each fixed k), where the spoiler can choose from either structure, but he can switch structure at most k times, and therefore the duplicator wins iff A and B satisfy the same first order formulas of rank at most r and quantifier alternation at most k (defined in the paper). We show that deciding the winner in both the one-sided EF game and the k-alternations EF game is also PSPACE complete.
KeywordsTruth Assignment Unary Relation Boolean Formula Isomorphism Problem Additional Vertex
Unable to display preview. Download preview PDF.
- 2.Pezzoli, E.: On the computational complexity of type-two functionals and logical games on finite structures. Ph.D thesis. Stanford University, Stanford (June 1998)Google Scholar
- 3.Pezzoli, E.: Classical paramteric complexity of logical games (in preparation)Google Scholar
- 4.Grohe, M.: Equivalence in finite-variable logics is complete for polynomial time. In: Proceeding FOCS 1996 (1996)Google Scholar
- 6.Köbler, J., Schöning, U., Torán, J.: The Graph Isomorphism Problem. Birkhäuser (1993)Google Scholar
- 7.Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Fifth Annual ACM Symposium on theory of computing, Association for Computing Machinery, New york, pp. 1–9 (1973)Google Scholar