Bulletin of Symbolic Logic · 1996 · 45 citations · 26 references
ComputingComputer ScienceMathematicsLogicSet TheoryTheory Of ComputationDescriptive ComplexityModel TheoryAsymptotic TheoryComplexityEquivalence Classes
Abstract We introduce a new framework for classifying logics on finite structures and studying their expressive power. This framework is based on the concept of almost everywhere equivalence of logics , that is to say, two logics having the same expressive power on a class of asymptotic measure 1. More precisely, if L, L′ are two logics and μ is an asymptotic measure on finite structures, then L ≡ a.e. L′ (μ) means that there is a class C of finite structures with μ(C) = 1 and such that L and L′ define the same queries on C . We carry out a systematic investigation of ≡ a.e. with respect to the uniform measure and analyze the ≡ a.e. -equivalence classes of several logics that have been studied extensively in finite model theory. Moreover, we explore connections with descriptive complexity theory and examine the status of certain classical results of model theory in the context of this new framework.
26
Choice Reviews Online · 1995 · 1.8K citations
The complexity of relational query languages (Extended Abstract)
Moshe Y. Vardi · 1982 · 1.2K citations
Computing, Computer Science, Algebra +16
On a generalization of quantifiers
Andrzej Mostowski · Fundamenta Mathematicae · 1957 · 688 citations · Full text
Relational queries computable in polynomial time
Neil Immerman · Information and Control · 1986 · 648 citations