On a monadic NP vs monadic co-NP
Information and Computation
Counting quantifiers, successor relations, and logarithmic space
Journal of Computer and System Sciences - special issue on complexity theory
Languages, automata, and logic
Handbook of formal languages, vol. 3
Logics with counting and local properties
ACM Transactions on Computational Logic (TOCL)
Counting modulo quantifiers on finite structures
Information and Computation - Special issue: LICS 1996—Part 1
Logics capturing local properties
ACM Transactions on Computational Logic (TOCL)
Logics with aggregate operators
Journal of the ACM (JACM)
Fixed-Parameter Tractability, Definability, and Model-Checking
SIAM Journal on Computing
Unary Quantifiers on Finite Models
Journal of Logic, Language and Information
Data Exchange: Semantics and Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Local Normal Forms for First-Order Logic with Applications to Games and Automata
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Data exchange: getting to the core
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Locally consistent transformations and query answering in data exchange
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
| Hi-index | 0.00 |
Locality is a standard notion of finite model theory. There are two well known flavors of it, based on Hanf's and Gaifman's theorems. Essentially they say that structures that locally look alike cannot be distinguished by first-order sentences. Very recently these standard notions have been generalized in two ways. The first extension makes the notion of ''looking alike'' depend on logical indistinguishability, rather than isomorphism, of local neighborhoods. The second extension considers transformations defined by FO formulae, and requires that small neighborhoods be preserved by those transformations. In this survey we explain these new notions - as well as the standard ones - and show how they behave with respect to Hanf's and Gaifman's conditions.