Arity hierarchies

Annals of Pure and Applied Logic

Volumn 82, Issue 2, 1996, Pages 103-163

  Grohe, Martin ^a  

^a Mathematisches Institut Eckerstr 1   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030571561     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/0168-0072(95)00072-0     Document Type: Article

References (25)

1. [1] S. Abiteboul and V. Vianu, Datalog extensions for database queries and updates, J. Comput. System Sci. 43 (1991) 62-124.
2. [2] F. Afrati and S. Cosmadakis, Expressiveness of restricted recursive queries, in: Proc. 21st ACM Symp. on Theory of Computing (1989) 113-126.
3. 1-formulae on finite structures, Ann. Pure Appl. Logic 24 (1983) 1-48.
4. [4] N. Alon and J. Spencer, The Probabilistic Method. (Wiley, New York, 1992).
5. [5] A. Calo and J.A. Makowsky, The Ehrenfeucht-Fraïssé game for transitive closure, in: A. Nerode and M. Taitsin, eds., Logical Foundation of Computer Science - Tver'92, Lecture Notes in Computer Science 620 (Springer, Berlin, 1992) 57-68.
6. [6] A. Chandra and D. Harel, Structure and complexity of relational queries, J. Comput. System Sci. 25 (1982) 99-128.
7. [7] A. Chandra and D. Harel, Horn clause queries and generalizations, J. Logic Programming 1 (1985) 1-15.
8. [8] A. Dawar, A restricted second order logic for finite structures, in: D. Leivant, ed., Logic and Computational Complexity: International Workshop, LCC '94, Lecture Notes in Computer Science 960 (Springer, Berlin, 1995).
9. [9] P. Dublish and S. Maheshwari, Expressibility of bounded arity fixed-point queries, in: Proc. 8th ACM Symp. on Principles of Database Systems (1989) 324-335.
10. [10] H.-D. Ebbinghaus and J. Flum, Finite Model Theory (Springer, Berlin, 1995).
11. [11] H.-D. Ebbinghaus, J. Flum and W. Thomas, Mathematical Logic (Springer, Berlin, 2nd ed., 1994).
12. [12] P. Erdös, Graph theory and probability, Canad. J. Math. 11 (1959) 34-38.
13. [13] E. Grädel, On transitive closure logic, in: Proc. 5th Workshop on Computer Science Logic, Lecture Notes in Computer Science 626 (Springer, Berlin, 1991) 149-163.
14. [14] M. Grohe, Bounded arity hierarchies in fixed-point logics, in: Proc. 7th Workshop on Computer Science Logic, Lecture Notes in Computer Science 832 (Springer, Berlin, 1993) 150-164.
15. [15] M. Grohe, The structure of fixed-point logics, Ph.D. Thesis, Albert-Ludwigs Universität Freiburg, 1994.
16. [16] M. Grohe and L. Hella, A double arity hierarchy theorem for transitive closure logic, Arch. Math. Logic, to appear.
17. [17] Y. Gurevich and S. Shelah, Fixed point extensions of first-order logic, Ann. Pure and Appl. Logic 32 (1986) 265-280.
18. [18] L. Hella, Logical hierarchies in PTIME, in: Proc. 7th IEEE Symp. in Logic and Computer Science, (1992) 360-368.
19. [19] B. Herwig, Extending partial isomorphisms on finite structures, Combinatorica 15 (1995) 365-372.
20. [20] E. Hrushovski, Extending partial isomorphisms of graphs, Combinatorica 12 (1992) 411-416.
21. [21] H. Imhof, The arity problem for fixed point logic - a complexity theoretical point of view, Research Report, Albert-Ludwigs-Universität Freiburg, 1994.
22. [22] N. Immerman, Languages that capture complexity classes, SIAM J. Comput. 16 (1987) 760-778.
23. [23] P.C. Kanellakis, Elements of relational database theory, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science (Elsevier, Amsterdam, 1990).
24. [24] Ph.G. Kolaitis, Implicit definability on finite structures and unambiguous computations, in: Proc. 5th IEEE Symp. on Logic in Computer Science, 1990.
25. [25] J.A. Makowsky and Y.B. Pnueli, Arity vs. alternation in second order logic, in: Logical Foundations of Computer Science - St. Petersburg 1994, Lecture Notes in Computer Science 813 (Springer, Berlin, 1994).