Abstract
Locality notions in logic say that the truth value of a formula can be determined locally, by looking at the isomorphism type of a small neighborhood of its free variables. Such notions have proved to be useful in many applications. They all, however, refer to isomorphism of neighborhoods, which most local logics cannot test for. A more relaxed notion of locality says that the truth value of a formula is determined by what the logic itself can say about that small neighborhood. Or, since most logics are characterized by games, the truth value of a formula is determined by the type, with respect to a game, of that small neighborhood. Such game-based notions of locality can often be applied when traditional isomorphism-based locality cannot.
Our goal is to study game-based notions of locality. We work with an abstract view of games that subsumes games for many logics. We look at three, progressively more complicated locality notions. The easiest requires only very mild conditions on the game and works for most logics of interest. The other notions, based on Hanf’s and Gaifman’s theorems, require more restrictions. We state those restrictions and give examples of logics that satisfy and fail the respective game-based notions of locality.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arenas, M., Barceló, P., Fagin, R., Libkin, L.: Locally consistent transformations and query answering in data exchange. In: PODS 2004, pp. 229–240 (2004)
Benedikt, M., Griffin, T., Libkin, L.: Verifiable properties of database transactions. Information and Computation 147(1), 57–88 (1998)
Dawar, A., Lindell, S., Weinstein, S.: Infinitary logic and inductive definability over finite structures. Information and Computation 119(2), 160–175 (1995)
Ebbinghaus, H.-D.: Extended logics: the general framework. In: Model-Theoretic Logics, pp. 25–76. Springer, Heidelberg (1985)
Etessami, K.: Counting quantifiers, successor relations, and logarithmic space. JCSS 54(3), 400–411 (1997)
Fagin, R.: Easier ways to win logical games. In: Immerman, N., Kolaitis, P. (eds.) Descriptive Complexity and Finite Models, AMS, pp. 1–32 (1997)
Fagin, R., Kolaitis, P.h., Miller, R., Popa, L.: Data exchange: Semantics and query answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 207–224. Springer, Heidelberg (2002)
Fagin, R., Stockmeyer, L., Vardi, M.: On monadic NP vs monadic co-NP. Information and Computation 120(1), 78–92 (1994)
Flum, J., Grohe, M.: Fixed-parameter tractability, definability, and model-checking. SIAM J. Comput. 31(1), 113–145 (2001)
Gaifman, H.: On local and non-local properties. In: Logic Colloquium 1981. North Holland, Amsterdam (1982)
Grohe, M., Schwentick, T.: Locality of order-invariant first-order formulas. TOCL 1(1), 112–130 (2000)
Grohe, M., Wöhrle, S.: An existential locality theorem. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 99–114. Springer, Heidelberg (2001)
Hanf, W.: Model-theoretic methods in the study of elementary logic. In: Addison, J.W., et al. (eds.) The Theory of Models, pp. 132–145. North Holland, Amsterdam (1965)
Hella, L.: Logical hierarchies in PTIME. Information and Computation 129(1), 1–19 (1996)
Hella, L., Libkin, L., Nurmonen, J.: Notions of locality and their logical characterizations over finite models. J. Symbolic Logic 64(4), 1751–1773 (1999)
Hella, L., Libkin, L., Nurmonen, J., Wong, L.: Logics with aggregate operators. JACM 48(4), 880–907 (2001)
Immerman, N., Lander, E.: Describing graphs: A first order approach to graph canonization. In: Complexity Theory Retrospective. Springer, Berlin (1990)
Keisler, H.J., Lotfallah, W.: Shrinking games and local formulas. Annals of Pure and Applied Logic 128, 215–225 (2004)
Kolaitis, P.h., Väänänen, J.: Generalized quantifiers and pebble games on finite structures. Annals of Pure and Applied Logic 74, 23–75 (1995)
Libkin, L.: On counting logics and local properties. TOCL 1(1), 33–59 (2000)
Libkin, L., Wong, L.: Lower bounds for invariant queries in logics with counting. TCS 288(1), 153–180 (2002)
Makowsky, J.: Algorithmic aspects of the Feferman-Vaught Theorem. Annals of Pure and Applied Logic 126, 159–213 (2004)
Nurmonen, J.: On winning strategies with unary quantifiers. Journal of Logic and Computation 6(6), 779–798 (1996)
Nurmonen, J.: Counting modulo quantifiers on finite structures. Information and Computation 160(1-2), 62–87 (2000)
Schwentick, T., Barthelmann, K.: Local normal forms for first-order logic with applications to games and automata. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 444–454. Springer, Heidelberg (1998)
Seese, D.: Linear time computable problems and first-order descriptions. Mathematical Structures in Computer Science 6(6), 505–526 (1996)
Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Languages, vol. 3, pp. 389–455. Springer, Heidelberg (1997)
Väänänen, J.: Unary quantifiers on finite models. J. Logic, Language and Information 6(3), 275–304 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arenas, M., Barceló, P., Libkin, L. (2004). Game-Based Notions of Locality Over Finite Models. In: Marcinkowski, J., Tarlecki, A. (eds) Computer Science Logic. CSL 2004. Lecture Notes in Computer Science, vol 3210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30124-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-30124-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23024-3
Online ISBN: 978-3-540-30124-0
eBook Packages: Springer Book Archive