Canonization for two variables and puzzles on the square

Annals of Pure and Applied Logic

Volumn 85, Issue 3, 1997, Pages 243-282

  Otto, Martin ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Canonization; Descriptive complexity; Finite model theory

Indexed keywords

EID: 0031584263     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(96)00047-4     Document Type: Article

References (33)

1. S. Abiteboul and V. Vianu, Fixpoint extensions of first-order logic and Datalog-like languages, in: Proc. 4th IEEE Symp. on Logic in Computer Science (1989) 71-79.
2. S. Abiteboul and V. Vianu, Generic computation and its complexity, Proc. 23rd ACM Symp. on Theory of Computing (1991) 209-219.
3. L. Babai, P. Erdös and M. Selkow, Random graph isomorphism, SIAM J. Comput. 9 (1980) 628-635.
4. L. Babai and L. Kučera, Canonical labellings of graphs in linear average time, IEEE Symp. on Foundations of Computer Science (1980) 39-46.
5. J. Barwise, On Moschovakis closure ordinals, J. Symbolic Logic 42 (1977) 292-296.
6. E. Börger, E. Grädel and Y. Gurevich, The Classical Decision Problem, Perspectives in Mathematical Logic (Springer, Berlin, 1996).
7. J. Cai, M. Fürer and N. Immerman, An optimal lower bound on the number of variables for graph identification, Combinatorica 12 (1992) 389-410.
8. A. Chandra and D. Harel, Structure and complexity of relational queries, J. Comput. System Sci. 25 (1982) 99-128.
9. A. Dawar, Feasible computation through model theory, Doctoral dissertation, University of Pennsylvania (1993).
10. A. Dawar, S. Lindell and S, Weinstein, Infinitary logic and inductive definability over finite structures, Inform. and Comput. 119 (1995) 160-175.
11. H.-D. Ebbinghaus and J. Flum, Finite Model Theory, Perspectives in Mathematical Logic (Springer, Berlin, 1995).
12. E. Grädel, Ph.G. Kolaitis and M.Y. Vardi, On the decison problem for two-variable first-order logic, Bulletin of the ASL, to appear.
13. E. Grädel and M. Otto, Inductive definability with counting on finite structures, in: E. Börger et al., ed., Computer Science Logic, Selected Papers from CSL '92, Lecture Notes in Computer Science, vol. 702 (Springer, Berlin, 1993) 231-247.
14. E. Grädel, M. Otto and E. Rosen, Undecidability results on two-variable logics, Preprint, 1996.
15. E. Grädel, M. Otto and E. Rosen, Two-variable logic with counting is decidable, Preprint, 1996.
16. Y. Gurevich, Logic and the challenge of computer science, in: E. Börger, ed., Trends in Theoretical Computer Science (Computer Science Press, Rockville, MD, 1988) 1-57.
17. Y. Gurevich and S. Shelah, On finite rigid structures, J. Symbolic Logic 61 (1996) 549-562.
18. I. Hodkinson, Finite variable logics, Bull. EATCS 51 (1993) 111-140.
19. N. Immerman, Upper and lower bounds for first-order expressibility, J. Comput. System Sci. 25 (1982) 76-98.
20. N. Immerman, Relational queries computable in polynomial time, Inform. and Control 68 (1986) 86-104.
21. N. Immerman, Expressibility as a complexity measure: results and directions, Proc. 2nd Structure in Complexity Conf. (1987) 194-202.
22. N. Immerman and E. Lander, Describing graphs: a first-order approach to graph canonization, in: A. Selman, ed., Complexity Theory Retrospective (Springer, Berlin, 1990) 59-81.
23. Ph. Kolaitis and M. Vardi, Infinitary logic and 0-1 laws, Inform. and Comput. 98 (1992) 258-294.
24. Ph. Kolaitis and M. Vardi, Fixpoint logic vs. infinitary logic in finite-model theory, Proc. 7th IEEE Symp. on Logic and Computer Science (1992) 46-57.
25. M. Mortimer, On languages with two variables, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 21 (1975) 135-140.
26. M. Otto, Ptime canonization for two variables with counting, Proc. 10th IEEE Symp. on Logic and Computer Science (1995) 342-352.
27. M. Otto, Bounded variable logics and counting - a study in finite models, Habilitation thesis RWTH Aachen (1995); revised: Lecture Notes in Logic, vol. 9 (Springer, Berlin, 1997).
28. M. Otto, Bounded variable logics and counting - a study in finite models, Habilitation thesis RWTH Aachen (1995); revised: Lecture Notes in Logic, vol. 9 (Springer, Berlin, 1997).
29. M. Otto, The expressive power of fixed-point logic with counting, J. Symbolic Logic 61 (1996) 147-176.
30. M. Otto, Bounded-variable logics: two, three, and more, Preprint, 1996.
31. n, J. Symbolic Logic 47 (1982) 641-658
32. D. Scott, A decision method for validity of sentences in two variables, J. Symbolic Logic 27 (1962) 377.
33. M. Vardi, Complexity of Relational Query Languages, Proc. 14th ACM Symp. on Theory of Computing (1982) 137-146.