1. Σ11 formulae on finite structures;Ajtai;Ann. Pure Appl. Logic,1983
2. Reachability is harder for directed than for undirected finite graphs;Ajtai;J. Symbolic Logic,1990
3. On winning strategies in Ehrenfeucht-Fraïssé games;Arora,1994
4. A left coset composed of n-cycles;Coppersmith,1994
5. Second-order and inductive definability on finite structures;de Rougemont;Z. Math. Logik Grundlag. Math.,1987