1. On winning strategies in EF games;Arora;Theoretical Computer Science,1997
2. Infinitary logic and inductively definability over finite structures;Dawar;Information and Computation,1995
3. An application of games to the completeness problem for formalized theories;Ehrenfeucht;Fundamenta Mathematicae,1961
4. R. Fraïssé, Sur quelques classfications des systèm de relations, Publication Scientifiques, Sér. A, 1, Université d Alger, 1954, pp. 35–182
5. M. Grohe, Equivalence in finite-variable logics is complete for polynomial time, in: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, FOCS96, 1996