On fixed-point logic with counting

Journal of Symbolic Logic

Volumn 65, Issue 2, 2000, Pages 777-787

  Flum, Jörg ^a   Grohe, Martin ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b Mathematisches Institut Eckerstr 1   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034403163     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2586569     Document Type: Article

References (18)

1. J. CAI, M. FüRER, and N. IMMERMAN, An optimal lower bound on the number of variables for graph identification, Combinatorica, vol. 12 (1992), pp. 389-410.
2. E. DAHLHAUS, Skolem normal forms concerning the least fixed point, Computation theory and logic (E. Borger, editor), Lecture Notes in Computer Science, no. 270, Springer-Verlag, 1987, pp. 20-36.
3. A. DAWAR, Generalized quantifiers and logical reducibilities, Journal of Logic and Computation, vol. 5 (1995), pp. 213-226.
4. A. DAWAR, S. LINDELL, and S. WEINSTEIN, Infinitary logic and inductive definability over finite structures, Information and Computation, vol. 119 (1995), pp. 160-175.
5. H.-D. EBBINGHAUS and J. FLUM, Finite model theory, Springer-Verlag, 1995.
6. J. FLUM, M. KUBIERSCHKY, and B. LUDäSCHER, Total and partial well-founded datalog coincide, Proceedings of the 6th International Conference on database theory, 1997, Lecture Notes in Computer Science, no. 1186, Springer-Verlag, pp. 113-129.
7. E. GRäDEL and M. OTTO, Inductive definability with counting on finite structures, Computer science logic, 6th workshop, CSL '92, San Miniato 1992, selected papers (E. Börger, G. Jäger, H. Kleine Büning, S. Martini, and M. M. Richter, editors), Lecture Notes in Computer Science, no. 702, Springer-Verlag, 1993, pp. 231-247.
8. M. GROHE, Complete problems for fixed-point logics, this JOURNAL, vol. 60 (1995), pp. 517-527.
9. _, Fixed-point logics on planar graphs, Proceedings of the 13th IEEE symposium on logic in computer science, 1998, pp. 6-15.
10. M. GROHE and J. MARIñO, Definability and descriptive complexity on databases of bounded treewidth, Proceedings of the 7th International Conference on database theory (C. Beeri, editor), Lecture Notes in Computer Science, Springer-Verlag, 1999, to appear.
11. Y. GUREVICH and S. SHELAH, Fixed point extensions of first-order logic, Annals of Pure and Applied Logic, vol. 32 (1986), pp. 265-280.
12. H. IMHOF, Regular logics that define their own semantics, to appear in Archive for Mathematical Logic.
13. N. IMMERMAN, Relational queries computable in polynomial time, Information and Control, vol. 68 (1986), pp. 86-104.
14. _, Expressibility as a complexity measure: results and directions, Proceedings of the 2nd IEEE symposium on structure in complexity theory, 1987, pp. 194-202.
15. N. IMMERMAN and E. LANDER, Describing graphs: A first-order approach to graph canonization, Complexity theory retrospective (A. Selman, editor), Springer-Verlag, 1990, pp. 59-81.
16. M. OTTO, The expressive power of fixed-point logic with counting, this JOURNAL, vol. 61 (1996), pp. 147-176.
17. _, Bounded variable logics and counting, Lecture Notes in Logic, no. 9, Springer-Verlag, 1997.
18. M. Y. VARDI, The complexity of relational query languages, Proceedings of the 14th ACM symposium on theory of computing, 1982, pp. 137-146.