A Restricted Second Order Logic for Finite Structures

Information and Computation

Volumn 143, Issue 2, 1998, Pages 154-174

  Dawar, Anuj ^a  

^a SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (25)

1. Abiteboul, S., Vardi, M. Y., and Vianu, V. (1997), Fixpoint logics, relational machines, and computational complexity, J. Assoc. Ccomput. Mach. 44, 30-56.
2. Abiteboul, S., and Vianu, V. (1991), Datalog extensions for database queries and updates, J. Comput. System Sci. 43, 62-124.
3. Abiteboul, S., and Vianu, V. (1995), Computing with first-order logic, J. Comput. System Sci. 50(2), 309-335.
4. Barwise, J. (1977), On Moschovakis closure ordinals, J. Symbolic Logic 42, 292-296.
5. Cai, J.-Y., Fürer, M, and Immerman, N. (1992), An optimal lower bound on the number of variables for graph identification, Combinatorica 12(4), 389-410.
6. Chandra, A., and Harel, D. (1982), Structure and complexity of relational queries, J. Comput. System Sci. 25, 99-128.
7. Dahlhaus, E. (1984), Reduction to NP-complete problems by interpretation, in "Lecture Notes in Computer Science," Vol. 171, pp. 357-365, Springer-Verlag, Berlin/New York.
8. Dawar, A (1993), "Feasible Computation through Model Theory," Ph.D. thesis, University of Pennsylvania.
9. Dawar, A., and Grädel, E. (1995), Generalized quantifiers and 0-1 laws, in "Proc. 10th IEEE Symp. on Logic in Computer Science," pp. 54-64.
10. Dawar, A., Lindell, S, and Weinstein, S. (1995), Infinitary logic and inductive definability over finite structures, Inform. and Comput. 119(2), 160-175.
11. de Rougemont, R. (1987), Second-order and inductive definability on finite structures, Z. Math. Logik Grundlag. Math. 33, 47-63.
12. Fagin, R. (1974), Generalized first-order spectra and polynomial-time recognizable sets, in "Complexity of Computation" (R. M. Karp, Ed.), SIAM-AMS Proceedings, Vol. 7, pp. 43-73.
13. Garey, M. R., and Johnson, D. S. (1979), "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, New York.
14. Gurevich, Y., and Shelah, S. (1986), Fixed-point extensions of first-order logic, Ann. Pure Appl. Logic 32, 265-280.
15. Immerman, N. (1982), Upper and lower bounds for first-order expressibility, J. Comput. System Sci. 25, 76-98.
16. Immerman, N. (1986), Relational queries computable in polynomial time, Inform. and Control 68, 86-104.
17. Immerman, N. (1989), Descriptive and computational complexity, in "Computational Complexity Theory, Proc. of AMS Symposia in Appl. Math." (J. Hartmanis, Ed.), Vol. 38, pp. 75-91.
18. Kolaitis, Ph. G., and Vardi, M. Y. (1992), Fixpoint logic vs. infinitary logic in finite-model theory, in "Proc. 7th IEEE Symp. on Logic in Computer Science," pp. 46-57.
19. Kolaitis, Ph. G., and Vardi, M. Y. (1992), Infinitary logics and 0-1 laws, Inform. and Comput 98(2), 258-294.
20. Leivant, D. (1990), Inductive definitions over finite structures, Inform. and Comput. 89, 95-108.
21. Lovász, L., and Gács, P. (1977), Some remarks on generalized spectra, Z. Math. Logik Grundlag. Math. 23, 27-144.
22. Moschovakis, Y. N. (1974), "Elementary Induction on Abstract Structures," North-Holland, Amsterdam.
23. Rubin, A. (1975), "Free Algebras in Von Neumann-Bernays-Gödel Set Theory and Positive Elementary Inductions in Reasonable Structures," Ph.D. thesis, California Institute of Technology.
24. Stockmeyer, L. (1976), The polynomial-time hierarchy, Theoret. Comput. Sci. 3, 1-22.
25. Vardi, M. Y. (1982), The complexity of relational query languages, in "Proc. 14th ACM Symposium on the Theory of Computing," pp. 137-146.