Logics with Counting and Local Properties

ACM Transactions on Computational Logic

Volumn 1, Issue 1, 2000, Pages 33-59

  Libkin, Leonid ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Counting; First order logic; Infinitary logic; Languages; Locality; Theory

Indexed keywords

EID: 84913541976     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/343369.343376     Document Type: Article

References (27)

1. Abiteboul, S. and Vianu, V. 1995. Computing with first-order logic. J. Comput. Syst. Sci. 50, 2 (Apr. 1995), 309-335.
2. Abiteboul, S., Hull, R., and Vianu, V. 1995. Foundations of Databases. Addison-Wesley, Reading, MA.
3. Benedikt, M. and Keisler, H. J. 1997. Expressive power of unary counters. In Proceedings of the International Conference on Database Theory (ICDT'97, Jan.), Springer Lecture Notes in Computer Science, vol. 1186. Springer-Verlag, New York.
4. Cai, J., FüRer, M., and Immerman, N. 1992. On optimal lower bound on the number of variables for graph identification. Combinatorica 12, 4, 398-410.
5. Dawar, A., Lindell, S., and Weinstein, S. 1995. First order logic, fixed point logic, and linear order. In Proceedings of the Conference on Computer Science Logic (CSL'95), 161-177.
6. DOng, G., Libkin, L., and Wong, L. 1997. Local properties of query languages. In Proceedings of the International Conference on Database Theory (ICDT'97, Jan.), Springer Lecture Notes in Computer Science, vol. 1186. Springer-Verlag, New York, 140-154.
7. Ebbinghaus, H.-D. and Flum, J. 1995. Finite Model Theory. Springer-Verlag, Vienna, Austria.
8. Etessami, K. 1997. Counting quantifiers, successor relations, and logarithmic space. J. Comput. Syst. Sci. 54, 3, 400-411.
9. Fagin, R., Stockmeyer, L. J., and Vardi, M. Y. 1995. On a monadic NP vs monadic co-NP. Inf. Comput. 120, 1 (July 1995), 78-92.
10. Gaifman, H. 1982. On local and non-local properties. In Proceedings of the Hebrand Symposium, Logic Colloquium' 81, North-Holland Publishing Co., Amsterdam, The Netherlands.
11. Grädel, E. and Gurevich, Y. 1998. Metafinite model theory. Inf. Comput. 140, 1, 26-81.
12. Grädel, E. and Otto, M. 1992. Inductive definability with counting on finite structures. In Proceedings of Computer Science Logic (CSL'92), Springer Lecture Notes in Computer Science, vol. 702. Springer-Verlag, New York, 231-247.
13. Grumbach, S. and Tollu, C. 1995. On the expressive power of counting. Theor. Comput. Sci. 149, 1 (Sept. 18, 1995), 67-99.
14. Hanf, W. 1965. Model-theoretic methods in the study of elementary logic. In The Theory of Models, J. W. Addison, Ed. North-Holland Publishing Co., Amsterdam, The Netherlands, 132-145.
15. Hella, L. 1996. Logical hierarchies in PTIME. Inf. Comput. 129, 1, 1-19.
16. Hella, L. and Sandu, G. 1995. Partially ordered connectives and finite graphs. In Quantifiers: Logics, Models and Computation II, M. Krynicki, M. Mostowski, and L. Szczerba, Eds. Kluwer Academic Publishers, Hingham, MA, 79-88.
17. Hella, L., Libkin, L., and Nurmonen, Y. 1999a. Notions of locality and their logical characterizations over finite models. J. Symb. Logic 64, 4 (Dec.), 1751-1773.
18. Hella, L., Libkin, L., Nurmonen, J., and Wong, L. 1999b. Logics with aggregate operators. In Proceedings of the 14th IEEE Symposium on Logic in Computer Science (LICS'99, Trento, Italy, July), IEEE Press, Piscataway, NJ, 35-44.
19. Immerman, N. 1998. Descriptive Complexity. Springer-Verlag, Vienna, Austria.
20. Immerman, N. and Lander, E. 1990. Describing graphs: A first order approach to graph canonization. In Complexity Theory Retrospective Springer-Verlag, Vienna, Austria.
21. Kolaitis, Ph. and Väänänen, J. 1995. Generalized quantifiers and pebble games on finite structures. Ann. Pure Appl. Logic 74, 23-75.
22. Kolaitis, P. G. and VardI, M. Y. 1992. Infinitary logics and 0-1 laws. Inf. Comput. 98, 2 (June), 258-294.
23. Libkin, L. 1997. On the forms of locality over finite models. In Proceedings of the 12th Symposium on Logic in Computer Science (LICS'97, June-July 1996), IEEE Press, Piscataway, NJ, 204-215.
24. Libkin, L. and Wong, L. 1997. Query languages for bags and aggregate functions. J. Comput. Syst. Sci. 55, 2, 241-272.
25. Mix-Barrington, D. A., Immerman, N., and Straubing, H. 1990. On uniformity within NC1. J. Comput. Syst. Sci. 41, 3 (Dec. 1990), 274-306.
26. Nurmonen, J. 1996. On winning strategies with unary quantifiers. J. Logic Comput. 6, 3, 779-798.
27. Otto, M. 1997. Bounded Variable Logics and Counting: A Study in Finite Models. Springer-Verlag, Vienna, Austria.