Arity and alternation in second-order logic

Annals of Pure and Applied Logic

Volumn 78, Issue 1-3, 1996, Pages 189-202

  Makowsky, J A ^a   Pnueli, Y B ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030568397     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/0168-0072(95)00013-5     Document Type: Article

References (14)

1. [1] M. Ajtai and R. Fagin, Reachability is harder for directed than for undirected finite graphs, J. Symbolic Logic 55 1 (1990) 113-150.
2. [2] J.R. Büchi, Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlag. Math. 6 (1960) 66-92.
3. [3] A. Calò and J.A. Makowsky, The Ehrenfeucht-Fraïssé games for transitive closure, in: A. Nerode and M. Taitsin, eds., Logical Foundation of Computer Science - Tver'92, Lecture Notes in Computer Science, Vol. 620 (Springer, Berlin, 1992) 57-68.
4. [4] B. Courcelle, The monadic second-order logic of graphs I: recognizable sets of finite graphs, Inform. and Comput. 85 (1990) 12-75.
5. [5] M. de Rougemont, Second-order and inductive definability on finite structures, Z. Math. Logik Grundlag. Math. 33 (1987) 47-63.
6. [6] J. Engelfriet, A regular characterization of graph languages definable in monadic second-order logic, Theoret. Comput. Sci. 88 (1991) 139-150.
7. [7] M. Grohe, Bounded-arity hierarchies in fixed point logics, Preprint, 1993.
8. [8] J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley Series in Computer Science (Addison-Wesley, Reading, MA, 1980).
9. [9] D.S. Johnson, A catalog of complexity classes, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. 1, Ch. 2 (Elsevier, Amsterdam, 1990).
10. [10] J.F. Lynch, Complexity classes and theories of finite models, Math. Systems Theory 15 (1982) 127-144.
11. [11] J.A. Makowsky and Y.B. Pnueli. Computable quantifiers and logics over finite structures, in: M. Krynicki, M. Mostowsky and L. Sczerba, eds., Logics, Models, and Computation, Vol. 1 (Kluwer Academic Publishers, Dordrecht, 1995) 313-357.
12. [12] J.A. Makowsky and Y.B. Pnueli, Arity vs. alternation in second-order definability, in: LFCS'94, Lecture Notes in Computer Science, Vol. 813 (Springer, Berlin 1994) 240-252.
13. [13] W. Thomas, Classifying regular events in symbolic logic, J. Comput. System Sci. 25 (1982) 360-376.
14. [14] G. Turán, On the definability of properties of finite graphs, Discrete Math. 49 (1984) 291-302.