Closure of monadic NP

Journal of Computer and System Sciences

Volumn 60, Issue 3, 2000, Pages 660-716

  Ajtai, Miklos ^a   Fagin, Ronald ^a   Stockmeyer, Larry ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; BOOLEAN FUNCTIONS; FORMAL LOGIC; GRAPH THEORY; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

BOOLEAN OPERATION; FIRST ORDER QUANTIFICATION; SECOND ORDER LOGIC; SECOND ORDER QUANTIFICATION;

COMPUTATIONAL COMPLEXITY;

EID: 0034206423     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1691     Document Type: Article

References (37)

1. Ajtai M., Fagin R. Reachability is harder for directed than for undirected finite graphs. J. Symbolic Logic. 55:1990;113-150.
2. Arora S., Fagin R. On winning strategies in Ehrenfeucht-Fraïssé games. Theoret. Comput. Sci. 174:1997;97-121.
3. Buss S. R., Hay L. On truth-table reducibility to SAT. Inform. and Comput. 91:1991;86-102.
4. Cai J. Y., Gundermann T., Hartmanis J., Hemachandra L. A., Sewelson V., Wagner K., Wechsung G. The Boolean hierarchy I: Structural properties. SIAM J. Comput. 17:1988;1232-1252.
5. S. S. Cosmadakis, Logical reducibility and monadic NP, in Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1993, pp. 52-61.
6. Courcelle B. The monadic second order logic of graphs VI: On several representations of graphs by relational structures. Discrete Appl. Math. 54:1994;117-149.
7. Durand A., Lautemann C., Schwentick T. Subclasses of binary NP. J. Logic Comput. 8:1998;189-207.
8. de Rougemont Michel. Second-order and inductive definability on finite structures. Z. Math. Logik Grundl. Math. 33:1987;47-63.
9. Ehrenfeucht A. An application of games to the completeness problem for formalized theories. Fund. Math. 49:1961;129-141.
10. Enderton H. B. A Mathematical Introduction to Logic. 1972;Academic Press, New York.
11. Fagin R. Generalized first-order spectra and polynomial-time recognizable sets. Karp R. M. Complexity of Computation, SIAM-AMS Proceedings. 1974;43-73.
12. Fagin R. Monadic generalized spectra. Z. Math. Logik Grundl. Math. 21:1975;89-96.
13. R. Fagin, Problem proposed at Oberwolfach Conference on Finite Model Theory, 1994.
14. Fagin R. Comparing the power of games on graphs. Math. Logic Quart. 43:1997;431-455.
15. Fraïssé R. Sur quelques classifications des systèmes de relations. Publ. Sci. Univ. Alger. Sér. A. 1:1954;35-182.
16. Fagin R., Stockmeyer L., Vardi M. Y. On monadic NP vs. monadic co-NP. Inform. and Comput. 120:1995;78-92.
17. Garey M., Johnson D. S., Stockmeyer L. J. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1:1976;237-267.
18. Golumbic M. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
19. Hanf W. Model-theoretic methods in the study of elementary logic. Addison J., Henkin L., Tarski A. The Theory of Models. 1965;132-145 North Holland, Amsterdam.
20. Immerman N. Descriptive and computational complexity. Hartmanis J. Computational Complexity Theory, Proc. Symp. Applied Math. 1989;75-91 Amer. Math. Soc.
21. Marcinkowsky J. Directed reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé games. Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL99). 1999.
22. Matz O. Technical Report. 1998.
23. Makowsky J. A., Pnueli Y. B. Arity vs alternation in second order logic. Ann. Pure and Appl. Logic. 78:1996;189-202.
24. Möhring R. H., Radermacher F. J. Substitution decomposition for discrete structures and connections with combinatorial optimization. Ann. Discrete Math. 19:1984;257-356.
25. 1, Informa. Process. Lett., 53, (1995), 337-339.
26. O. Matz, and, W. Thomas, Personal communication, 1997.
27. Matz O., Thomas W. The monadic quantifier alternation hierarchy over graphs is infinite. Proc. 12th IEEE Symposium on Logic in Computer Science. 1997;. p. 236-244.
28. 1. Informa. Process. Lett. 53:1995;337-339.
29. Schwentick T. Graph connectivity, monadic NP and built-in relations of moderate degree. Proc. 22nd International Colloq. on Automata, Languages, and Programming. 1995;. p. 405-416.
30. Schwentick T. On winning Ehrenfeucht games and monadic NP. Annals Pure Appl. Logic. 79:1996;61-92.
31. Schweikardt N. The monadic quantifier alternation hierarchy over grids and pictures. Lecture Notes in Computer Science. 1414:1997;441-460.
32. Shoenfield J. R. Mathematical Logic. 1967;Addison-Wesley, Reading.
33. 4-trees and substitution decomposition. Discrete Appl. Math. 39:1992;263-291.
34. Stockmeyer L. J. The polynomial-time hierarchy. Theoret. Comput. Sci. 3:1977;1-22.
35. Turán G. On the definability of properties of finite graphs. Discrete Math. 49:1984;291-302.
36. Wagner K. W. Bounded query classes. SIAM J. Comput. 19:1990;833-846.
37. Wrathall C. Complete sets and the polynomial-time hierarchy. Theoret. Comp. Sci. 3:1977;23-33.