Almost everywhere equivalence of logics in finite model theory

Bulletin of Symbolic Logic 2 (4):422-443 (1996)
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 $\scr{L}\equiv _{\text{a.e.}}\scr{L}^{\prime}(\mu)$ 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 $\equiv _{\text{a.e.}}$ with respect to the uniform measure and analyze the $\equiv _{\text{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
Keywords complexity   descriptive   finite   generalized   model   quantifiers   theory
Categories (categorize this paper)
DOI 10.2307/421173
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,781
Through your library
References found in this work BETA
Fixed-Point Extensions of First-Order Logic.Yuri Gurevich & Saharon Shelah - 1986 - Annals of Pure and Applied Logic 32 (3):265-280.
Probabilities on Finite Models.Ronald Fagin - 1976 - Journal of Symbolic Logic 41 (1):50-58.
Monadic Generalized Spectra.Ronald Fagin - 1975 - Mathematical Logic Quarterly 21 (1):89-96.

Add more references

Citations of this work BETA
Strong Convergence in Finite Model Theory.Wafik Boulos Lotfallah - 2002 - Journal of Symbolic Logic 67 (3):1083-1092.
How to Define a Linear Order on Finite Models.Lauri Hella, Phokion G. Kolaitis & Kerkko Luosto - 1997 - Annals of Pure and Applied Logic 87 (3):241-267.
The Metamathematics of Random Graphs.John T. Baldwin - 2006 - Annals of Pure and Applied Logic 143 (1):20-28.
Finite Variable Logics in Descriptive Complexity Theory.Martin Grohe - 1998 - Bulletin of Symbolic Logic 4 (4):345-398.

View all 7 citations / Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
215 ( #19,091 of 2,199,753 )

Recent downloads (6 months)
1 ( #300,206 of 2,199,753 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature