Counting modulo quantifiers on finite structures

Information and Computation

Volumn 160, Issue 1-2, 2000, Pages 62-87

  Nurmonen, Juha ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

FINITE STRUCTURES;

FORMAL LOGIC;

EID: 0034632156     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2842     Document Type: Article

References (31)

1. 1 formulae on finite structures, Ann. Pure Appl. Logic 24, 1-48.
2. Abiteboul, S., and Vianu, V. (1989), Fixpoint extensions of first-order logic and Datalog-like languages, in "Proc. 4th IEEE Symp. on Logic in Computer Science," p. 71-79.
3. 1, J. Comput. System Sci. 38, 150-164.
4. 1, J. Comput. System Sci. 44, 478-499.
5. 1, J. Comput. System Sci. 41, 274-306.
6. Corredor, L. J. (1986), El reticulo de las logicas de primer orden con cuantificadores cardinales identification, Rev. Colombiana Math. 20, 1-26.
7. Courcelle, B. (1990), Graph rewriting: An algebraic and logic approach, In "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. B, pp. 193-242, Elsevier Science, Amsterdam.
8. Courcelle, B. (1990), The monadic second-order logic of graphs I. Recognizable sets of finite graphs, Inform. and Comput. 85, 12-75.
9. Courcelle, B. (1996), The monadic second-order logic of graphs X: Linear orders, Theoret. Comput. Sci. 160, 87-143.
10. Compton, K., and Straubing, H. (Oct. 1992), Characterizations of regular languages in low level complexity classes, in "Bulletin of the EATCS," pp. 134-142.
11. Ebbinghaus, H.-D., and Flum, J. (1995), "Finite Model Theory," Perspectives in Mathematical Logic, Springer-Verlag, Berlin.
12. Furst, M., Saxe, J. B., and Sipser, M. (1984), Parity, circuits and the polynomial time hierarchy, Math. System Theory 17, 13-27.
13. Fagin, R., Stockmeyer, L., and Vardi, M. (1995), On monadic NP vs. monadic co-NP, Inform. and Comput. 120, 78-92.
14. Gurevich, Y. (1984), Toward logic tailored for computational complexity, in "Computation and Proof Theory" (M. M. Ricther et al., eds.), Lecture Notes in Mathematics, Vol. 1104, pp. 175-216, Springer-Verlag, Berlin.
15. Hanf, W. (1965), Model-theoretic methods in the study of elementary logic, in "The Theory of Models" (J. Addison, L. Henkin, and A. Tarski, Eds.), pp. 132-145, North Holland, Amsterdam.
16. Hella, L. (1989), Definability hierarchies of generalized quantifiers, Ann. Pure Appl. Logic 43, 235-271.
17. Hella, L. (1996), Logical hierarchies in PTIME, Inform. and Comput. 129, 1-19.
18. Immerman, N. (1986), Relational queries computable in polynomial time, Inform. and Control 68, 86-104.
19. Kolaitis, Ph. G., and Väänänen, J. A. (1995), Generalized quantifiers and pebble games on finite structures, Ann. Pure Appl. Logic 74, 23-75.
20. Luosto, K., Hierarchies of monadic generalized quantifiers, Symbolic Logic, in press.
21. McNaughton, R., and Papert, S. (1971), "Counter-Free Automata," MIT Press, Cambridge, MA.
22. Niwiński, D., and Stolboushkin, A. (1993), y = 2x vs. y = 3x, in "Proc. 8th IEEE Symp. on Logic in Computer Science," pp. 172-178. Full version appears in Symbolic Logic 62(2), 661-672.
23. Nurmonen, J. (1996), On winning strategies with unary quantifiers, J. Logic and Comput. 6(6), 779-798.
24. Rabin, M. O. (1969), Decidability of second order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141, 1-35.
25. Schwentick, T. (1996), On winning Ehrenfeucht games and monadic NP, Ann. Pure Appl. Logic 79, 61-92.
26. Seese, D. G. (1972), Entscheidbarkeits- und Defienierbarkeitsfragen der Theorie "netzartiger" Graphen-I, Wiss. Humboldt-Univ., Math.-Nat. R. XXI, 513-517.
27. Seese, D. (1992), Interpretability and tree automata: a simple way to solve algorithmic problems on graphs closely related to trees, in "Tree Automata and Languages" (M. Nivat and A. Podelski, Eds.), Vol. 103, pp. 83-114, Elsevier Science, Amsterdam.
28. Smolensky, R. (1987), Algebraic methods in the theory of lower bounds for Boolean circuit complexity, in "19th ACM STOC Symp.," pp. 77-82.
29. Straubing, H., Thérien, D., and Thomas, W. (1995), Regular languages defined with generalized quantifiers, Inform. and Comput. 118, 289-301.
30. Väänänen, J. (June 1997), Unary quantifiers on finite models, J. Logic Lang. Inform. 6, 275-304.
31. Vardi, M. (1982), The complexity of relational query languages, in "Proceedings, 14th ACM Symposium on Theory of Computing," pp. 137-146.