On winning Ehrenfeucht games and monadic NP

Annals of Pure and Applied Logic

Volumn 79, Issue 1, 1996, Pages 61-92

  Schwentick, Thomas ^a  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030563350     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/0168-0072(95)00030-5     Document Type: Article

References (18)

1. 1 formulae on finite structures, Ann. Pure Appl. Logic 24 (1983) 1-48.
2. [2] M. Ajtai and R. Fagin, Reachability is harder for directed than for undirected finite graphs, J. Symbolic Logic 55(1) (1990) 113-150.
3. [3] S. Arora and R. Fagin, On winning strategies in Ehrenfeucht-Fraïssé games, unpublished manuscript (1994).
4. [4] D. Coppersmith, A left coset composed of n-cycles, Research report RC 19511, IBM, 1994.
5. [5] M. de Rougemont, Second-order and inductive definability on finite structures, Z. Math. Logik Grundlag. Math. 33 (1987) 47-63.
6. [6] A. Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fund. Math. 49, (1961) 129-141.
7. [7] R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: R.M. Karp, ed., Complexity of Computation, SIAM-AMS Proceedings, Vol. 7 (1974) 43-73.
8. [8] R. Fagin, Monadic generalized spectra, Z. Math. Logik Grundlag. Math. 21 (1975) 89-96.
9. [9] R. Fagin, L. Stockmeyer and M. Vardi, On monadic NP vs. monadic co-NP, in: Proc. 8th Ann. IEEE Conf. Structure in Complexity Theory (1993) 19-30.
10. [10] R. Fraïssé, Sur quelques classifications des systèmes de relations, Publ. Sci. Univ. Alger. Sér. A 1 (1954) 35-182.
11. [11] E. Graedel, On logical descriptions of some concepts in structural complexity classes, in: E. Börger, H. Kleine Buning and M.M. Richter, eds., CSL '89: 3rd Workshop on Computer Science Logic, Lecture Notes in Computer Science (440) (Springer, Berlin 1990) 163-175.
12. [12] E. Grandjean, First-order spectra with one variable, J. Comput. System Sci. 40 (1990) 136-153.
13. [13] C. Lautemann, T. Schwentick and D. Thérien, Logics for context-free languages, in: Proc. 1994 Ann. Conf. EACSL (1994).
14. [14] B. Loescher, Begründung, Verallgemeinerung und Anwendung der Ehrenfeucht-Spiele in der Relationentheorie von Roland Fraïssé, Informatik-bericht 2/91, Institut für Informatik, Universität Mainz, 1991.
15. [15] J.F. Lynch, Complexity classes and theories of finite models, Math. Systems Theory 15 (1982) 127-144.
16. [16] M. Sekanina, On an ordering of the set of vertices of a connected graph, Spisy Přírod. Fak. Univ. Brno (1960) 137-141.
17. [17] T. Schwentick, On winning Ehrenfeucht games and monadic NP, Ph.D. Thesis, Universität Mainz, 1994.
18. [18] R. Tenney, Second-order Ehrenfeucht games and the decidability of the second-order theory of an equivalence relation, J. Austral. Math. Soc. 20 (1975) 323-331.