Game-based notions of locality over finite models

Arenas, 2004, Locally consistent transformations and query answering in data exchange, 229 Benedikt, 1998, Verifiable properties of database transactions, Information and Computation, 147, 57, 10.1006/inco.1998.2731 Etessami, 1997, Counting quantifiers, successor relations, and logarithmic space, Journal of Computer and System Sciences, 54, 400, 10.1006/jcss.1997.1485 Fagin, 1997, Easier ways to win logical games, 1 Fagin, 2005, Data exchange: Semantics and query answering, Theoretical Computer Science, 336, 89, 10.1016/j.tcs.2004.10.033 Fagin, 1994, On monadic NP vs monadic co-NP, Information and Computation, 120, 78, 10.1006/inco.1995.1100 Flum, 2001, Fixed-parameter tractability, definability, and model-checking, SIAM Journal on Computing, 31, 113, 10.1137/S0097539799360768 Gaifman, 1982, On local and non-local properties Grohe, 2004, An existential locality theorem, Annals of Pure and Applied Logic, 129, 131, 10.1016/j.apal.2004.01.005 Hanf, 1965, Model-theoretic methods in the study of elementary logic, 132 Hella, 1996, Logical hierarchies in PTIME, Information and Computation, 129, 1, 10.1006/inco.1996.0070 Hella, 1999, Notions of locality and their logical characterizations over finite models, The Journal of Symbolic Logic, 64, 1751, 10.2307/2586810 Hella, 2001, Logics with aggregate operators, Journal of the ACM, 48, 880, 10.1145/502090.502100 Immerman, 1990, Describing graphs: A first order approach to graph canonization Keisler, 2004, Shrinking games and local formulas, Annals of Pure and Applied Logic, 128, 215, 10.1016/j.apal.2004.01.004 Keisler, 2005, A local normal form theorem for infinitary logic with unary quantifiers, Mathematical Logic Quarterly, 51, 137, 10.1002/malq.200410013 Kolaitis, 1995, Generalized quantifiers and pebble games on finite structures, Annals of Pure and Applied Logic, 74, 23, 10.1016/0168-0072(94)00025-X Libkin, 2000, On counting logics and local properties, ACM Transactions on Computational Logic, 1, 33, 10.1145/343369.343376 Libkin, 2002, Lower bounds for invariant queries in logics with counting, Theoretical Computer Science, 288, 153, 10.1016/S0304-3975(01)00152-9 Makowsky, 2004, Algorithmic aspects of the Feferman–Vaught Theorem, Annals of Pure and Applied Logic, 126, 159, 10.1016/j.apal.2003.11.002 Nurmonen, 1996, On winning strategies with unary quantifiers, Journal of Logic and Computation, 6, 779, 10.1093/logcom/6.6.779 Nurmonen, 2000, Counting modulo quantifiers on finite structures, Information and Computation, 160, 62, 10.1006/inco.1999.2842 Schwentick, 1998, Local normal forms for first-order logic with applications to games and automata, 444 Seese, 1996, Linear time computable problems and first-order descriptions, Mathematical Structures in Computer Science, 6, 505, 10.1017/S0960129500070079 Thomas, 1997, vol. 3, 389 Väänänen, 1997, Unary quantifiers on finite models, Journal of Logic, Language and Information, 6, 275, 10.1023/A:1008209019899