Finite variable logics in descriptive complexity theory

Bulletin of Symbolic Logic

Volumn 4, Issue 4, 1998, Pages 345-398

  Grohe, Martin ^a  

^a Mathematisches Institut Eckerstr 1   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040944353     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2307/420954     Document Type: Article

References (71)

1. S. ABITEBOUL, M. Y. VARDI, and V. VIANU, Fixpoint logics, relational machines, and computational complexity, Journal of the ACM, vol. 44 (1997), pp. 30-56.
2. S. ABITEBOUL and V. VIANU, Generic computation and its complexity, Proceedings of the 23rd ACM symposium on theory of computing, 1991, pp. 209-219.
3. L. BABAI, P. ERDÖS, and S. SELKOW, Random graph isomorphism, SIAM Journal on Computing, vol. 9 (1980), pp. 628-635.
4. L. BABAI and E. M. LUKS, Canonical labeling of graphs, Proceedings of the 15th ACM symposium on theory of computing, 1983, pp. 171-183.
5. J. BARWISE, Back and forth through infinitary logic, Studies in model theory (M. D. Morley, editor), Studies in Mathematics, Mathematical Association of America, 1973, pp. 5-34.
6. _, On Moschovakis closure ordinals, this JOURNAL, vol. 42 (1977), pp. 292-296.
7. A. BLASS, Y. GUREVICH, and D. KOZEN, A zero-one law for logic with a fixed-point operator, Information and Control, vol. 67 (1985), pp. 70-90.
8. E. BÖRGER, E. GRÄDEL, and Y. GUREVICH, The classical decision problem, Springer-Verlag, 1997.
9. 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.
10. P. CAMERON, Combinatorics: Topics, techniques, algorithms, Cambridge University Press, 1994.
11. A. CHANDRA and D. HAREL, Structure and complexity of relational queries, Journal of Computer and System Sciences, vol. 25 (1982), pp. 99-128.
12. A. DAWAR, Feasible computation through model theory, Ph.D. thesis, University of Pennsylvania, 1993.
13. _, Generalized quantifiers and logical reducibilities, Journal of Logic and Computation, vol. 5 (1995), pp. 213-226.
14. _, A restricted second order logic for finite structures, Logic and computational complexity: International workshop, LCC '94 (D. Leivant, editor), Lecture Notes in Computer Science, vol. 960, Springer-Verlag, 1995.
15. _, Types and indiscernibles in finite models, Logic colloquium '95 (J. A. Makowsky and E. V. Ravve, editors), Lecture Notes in Logic, vol. 11, Springer-Verlag, 1998, pp. 51-65.
16. A. DAWAR, L. HELLA, and PH. G. KOLAITIS, Implicit definability and infinitary logic in finite model theory, Proceedings of the 22nd international colloquium on automata, languages and programming, 1995, pp. 624-635.
17. A. DAWAR, S. LINDELL, and S. WEINSTEIN, Infinitary logic and inductive definability over finite structures, Information and Computation, vol. 119 (1995), pp. 160-175.
18. H.-D. EBBINGHAUS, Extended logics: The general framework, Model-theoretic logics (J. Barwise and S. Feferman, editors), Springer-Verlag, 1985, pp. 25-76.
19. H.-D. EBBINGHAUS and J. FLUM, Finite model theory, Springer-Verlag, 1995.
20. H.-D. EBBINGHAUS, J. FLUM, and W. THOMAS, Mathematical logic, 2nd ed., Springer-Verlag, 1994.
21. R. FAGIN, Generalized first-order spectra and polynomial-time recognizable sets, Complexity of computation (R. M. Karp, editor), SIAM-AMS Proceedings, vol. 7, 1974, pp. 43-73.
22. I. S. FILOTTI and J. N. MAYER, A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus, Proceedings of the 12th ACM symposium on theory of computing, 1980, pp. 236-243.
23. J. FLUM and M. ZIEGLER, private communication.
24. E. GRÄDEL, PH. G. KOLAITIS, and M. Y. VARDI, On the decision problem for two-variable first-order logic, Bulletin of Symbolic Logic, vol. 3 (1997), pp. 53-69.
25. 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, vol. 702, Springer-Verlag, 1993, pp. 231-247.
26. E. GRÄDEL and M. OTTO, On logics with two variables, Theoretical Computer Science, to appear, 1998.
27. E. GRÄDEL, M. OTTO, and E. ROSEN, Two-variable logic with counting is decidable, Proceedings of the 12th IEEE symposium on logic in computer science, 1997, pp. 306-317.
28. _, Undecidability results on two-variable logics, Proceedings of the 14th annual symposium on theoretical aspects of computer science, 1997, pp. 249-260.
29. M. GROHE, Equivalence in finite-variable logics is complete for polynomial time, Proceedings of the 37th annual IEEE symposium on foundations of computer science, 1996, pp. 264-273.
30. k-types, Proceedings of the 12th IEEE symposium on logic in computer science, 1997, pp. 216-227.
31. k-equivalence is hard, Computer science logic, 11th international workshop CSL '97 (Selected papers) (M. Nielsen and W. Thomas, editors), Lecture Notes in Computer Science, vol. 1414, Springer-Verlag, 1998.
32. _, Fixed-point logics on planar graphs, Proceedings of the 13th IEEE symposium on logic in computer science, 1998, pp. 6-15.
33. M. GROHE and J. MARIÑO, Definability and descriptive complexity on databases of bounded tree-width, Proceedings of the 7th international conference on database theory (C. Beeri, editor), Lecture Notes in Computer Science, Springer-Verlag, 1999, to appear.
34. Y. GUREVICH, Toward logic tailored for computational complexity, Computation and proof theory (M. M. Richter, E. Börger, W. Oberschelp, B. Schinzel, and W. Thomas, editors), Lecture Notes in Mathematics, vol. 1104, Springer-Verlag, 1984, pp. 175-216.
35. _, Logic and the challenge of computer science, Current trends in theoretical computer science (E. Börger, editor), Computer Science Press, 1988, pp. 1-57.
36. _, From invariants to canonization, Bulletin of the European Association for Theoretical Computer Science, vol. 63 (1997), pp. 115-119.
37. Y. GUREVICH and S. SHELAH, Fixed point extensions of first-order logic, Annals of Pure and Applied Logic, vol. 32 (1986), pp. 265-280.
38. _, On finite rigid structures, this JOURNAL, vol. 61 (1996), pp. 549-562.
39. L. HELLA, Definability hierarchies of generalized quantifiers, Annals of Pure and Applied Logic, vol. 43 (1989), pp. 235-271.
40. _, Logical hierarchies in PTIME, Information and Computation, vol. 129 (1996), pp. 1-19.
41. L. HELLA, PH. G. KOLAITIS, and K. LUOSTO, Almost everywhere equivalence of logics infinite model theory, Bulletin of Symbolic Logic, vol. 2 (1996), pp. 422-443.
42. _, How to define a linear order on finite models, Annals of Pure and Applied Logic, vol. 87 (1997), pp. 241-267.
43. W. HODGES, Model theory, Cambridge University Press, 1993.
44. J. E. HOPCROFT and R. TARJAN, Efficient planarity testing, Journal of the ACM, vol. ? (1974), pp. 549-568.
45. N. IMMERMAN, Upper and lower bounds for first-order expressibility, Journal of Computer and System Sciences, vol. 25 (1982), pp. 76-98.
46. _, Relational queries computable in polynomial time, Information and Control, vol. 68 (1986), pp. 86-104.
47. _, Expressibility as a complexity measure: results and directions, Proceedings of the 2nd IEEE symposium on structure in complexity theory, 1987, pp. 194-202.
48. _, Languages that capture complexity classes, SIAM Journal on Computing, vol. 16 (1987), pp. 760-778.
49. 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.
50. R. M. KARP and R. J. LIPTON, Turing machines that take advice, L'Enseignement Mathématique, vol. 28 (1982), pp. 191-209.
51. PH. G. KOLAITIS and M. Y. VARDI, Fixpoint logic vs. infinitary logic in finite-model theory, Proceedings of the 7th IEEE symposium on logic in computer science, 1992, pp. 46-57.
52. _, Infinitary logic and 0-1 laws, Information and Computation, vol. 98 (1992), pp. 258-294.
53. _, Infinitary logic for computer science, Proceedings of the 19th international colloquium on automata, languages and programming, Lecture Notes in Computer Science, vol. 623, Springer-Verlag, 1992, pp. 450-473.
54. _, On the expressive power of variable-confined logics, Proceedings of the 11th IEEE symposium on logic in computer science, 1996.
55. S. LINDELL, An analysis of fixed-point queries on binary trees, Theoretical Computer Science, vol. 85 (1991), pp. 75-95.
56. A. LIVCHAK, The relational model for process control, Automated Documentation and Mathematical Linguistics, vol. 4 (1983), pp. 27-29.
57. L. LOVÁSZ and P. GÁCS, Some remarks on generalized spectra, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 23 (1977), pp. 27-144.
58. J. V. MATIJASEVIČ, Enumerable sets are diophantic, Soviet Mathematics Doklady, vol. 11 (1970), pp. 345-357.
59. G. L. MILLER, Isomorphism testing for graphs of bounded genus, Proceedings of the 12th ACM symposium on theory of computing, 1980, pp. 225-235.
60. M. MORTIMER, On languages with two variables, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. ? (1975), pp. 135-140.
61. Y. N. MOSCHOVAKIS, On nonmonotone inductive definability, Fundamenta Mathematicae, vol. 82 (1974), pp. 39-83.
62. M. OTTO, Ptime canonization for two variables with counting, Proceedings of the 10th IEEE symposium on logic in computer science, 1995, pp. 342-352.
63. _, The expressive power of fixed-point logic with counting, this JOURNAL, vol. 61 (1996), pp. 147-176.
64. _, Bounded variable logics and counting, Lecture Notes in Logic, vol. 9, Springer-Verlag, 1997.
65. L. PACHOLSKI, W. SZWAST, and L. TENDERA, Complexity of two-variable logic with counting, Proceedings of the 12th IEEE symposium on logic in computer science, 1997, pp. 318-327.
66. C. H. PAPADIMITRIOU, Computational complexity, Addison-Wesley, 1994.
67. n, this JOURNAL, vol. 47 (1982), pp. 641-658.
68. D. SCOTT, Logics with denumerably long formulas and finite strings of quantifiers, Theory of models (J. W. Addison, L. Henkin, and A. Tarski, editors), North-Holland, 1965, pp. 329-341.
69. A. SETH, When do fixed point logics capture complexity classes?, Proceedings of the 10th IEEE symposium on logic in computer science, 1995, pp. 353-363.
70. M. Y.VARDI, The complexity of relational query languages, Proceedings of the 14th ACM symposium on theory of computing, 1982, pp. 137-146.
71. _, On the complexity of bounded-variable queries, Proceedings of the 14th ACM symposium on principles of database systems, 1995, pp. 266-276.