On counting logics and local properties

Proceedings - Symposium on Logic in Computer Science

Volumn 1998-June, Issue , 1998, Pages 501-512

  Libkin, Leonid ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

EXPRESSIVE POWER; EXTENSIONS OF FIRST-ORDER LOGIC; FINITE STRUCTURES; FIRST ORDER; FIRST ORDER LOGIC; GENERALIZED QUANTIFIERS; INFINITARY; LOCAL PROPERTY;

COMPUTER CIRCUITS;

EID: 84959062413     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.1998.705683     Document Type: Conference Paper

References (28)

1. S. Abiteboul, R. Hull and V. Vianu. Foundations of Databases, Addison Wesley, 1995.
2. S. Abiteboul and V. Vianu. Computing with first- order logic. JCSS 50 (1995), 309-335.
3. A.Barrington, N. Immerman, H. Straubing. On uniformity within NC1. JCSS, 41:274-306, 1990.
4. M. Benedikt, H.J. Keisler. Expressive power of unary counters. ICDT'97, pages 291-305.
5. J. Cai, M. Furer and N. Immerman. On optimal lower bound on the number of variables for graph identification. Combinatorica, 12 (1992), 389-410.
6. A. Dawar, S. Lindell, S. Weinstein. First order logic, fixed point logic, and linear order. In CSL'95, pages 161-177.
7. G Dong, L. Libkin and L. Wong. Local properties of query languages. ICDT'97, pages 140-154.
8. D. Ebbinghaus and J. Flum. Finite Model Theory. Springer Verlag, 1995.
9. K. Etessami. Counting quantifiers, successor relations, and logarithmic space, JCSS, 54 (1997), 400411.
10. R. Fagin, L. Stockmeyer and M. Vardi, On monadic NP vs monadic co-NP, Information and Computation, 120 (1994), 78-92.
11. H. Gaifman. On local and non-local properties, Proceedings of the Herbrand Symposium, logic Colloquium '81, North Holland, 1982.
12. E Gradel and Y. Gurevich. Metafinite model theory. Information and Computation 140 (1998), 26-81.
13. E. Gradel and M. Otto. Inductive definability with counting on finite structures. In CSI'92, pages 231247.
14. S. Grumbach and C. Tollu. On the expressive power of counting. TCS 149 (1995), 67-99.
15. W. Hanf. Model-Theoretic methods in the study of elementary logic. In J.W. Addison et al, eds, The Theory of Models, North Holland, 1965, pages 132145.
16. L. Hella. Logical hierarchies in PTIME. Information and Computation, 129 (1996), 1-19.
17. L. Hella, L. Libkin and J. Nurmonen. Notions of locality and their logical characterizations over finite models. Manuscript, 1997.
18. L. Hella and G. Sandu. Partially ordered connectives and finite graphs. In M. Krynicki et al, eds, Quantifiers: logics, Models and Computation II, Kluwer, 1995, pages 79-88.
19. N. Immerman and E. Lander. Describing graphs: A first order approach to graph canonization. In Complexity Theory Retrospective, Springer Verlag, Berlin, 1990.
20. Ph. Kolaitis and J. Vaananen. Generalized quantifiers and pebble games on finite structures. Annals of Pure and Applied logic, 74 (1995), 23-75.
21. Ph. Kolaitis, M. Vardi. Infinitary logic and 0-1 laws. Information and Computation, 98 (1992), 258-294.
22. L. Libkin. On the forms of locality over finite models. In LICS'97, pages 204-215.
23. L. Libkin. On counting logics and local properties. Bell Labs, Technical Memo, 1997.
24. L. Libkin, L. Wong. Query languages for bags and aggregate functions. JCSS 55 (1997), 241-272.
25. S. Lifsches and S. Shelah. Distorted sums of models. Unpublished manuscript.
26. J. Nurmonen. On winning strategies with unary quantifiers. J. logic and Computation, 6 (1996), 779-798.
27. M. Otto. Bounded Variable logics and Counting: A Study in Finite Models. Springer Verlag, 1997.
28. T. Schwentick. On winning Ehrenfeucht games and monadic NP. Annals of Pure and Applied logic, 79 (1996), 61-92.