Almost Everywhere Equivalence of Logics in Finite Model Theory

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.

[1]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[2]  Stéphane Grumbach.  A Paradox in Database Theory , 1992, ICDT.

[3]  Jerzy Tyszkiewicz,et al.  The infinitary logic of sparse random graphs , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[4]  Phokion G. Kolaitis,et al.  Generalized Quantifiers and Pebble Games on Finite Structures , 1995, Ann. Pure Appl. Log..

[5]  Lauri Hella,et al.  How to define a linear order on finite models , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[6]  B. Bollobás.  The evolution of random graphs , 1984 .

[7]  Phokion G. Kolaitis,et al.  Generalized quantifiers and pebble games on finite structures , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[8]  Lauri Hella,et al.  The hierarchy theorem for generalized quantifiers , 1996, Journal of Symbolic Logic.

[9]  Yu. V. Glebskii,et al.  Range and degree of realizability of formulas in the restricted predicate calculus , 1969 .

[10]  Monica McArthur.  Convergence and 0-1 Laws for L_inf, omega^k under Arbitrary Measures , 1994, CSL.

[11]  Ronald Fagin,et al.  Probabilities on finite models , 1976, Journal of Symbolic Logic.

[12]  J. Spencer,et al.  Zero-one laws for sparse random graphs , 1988 .

[13]  Perlindström.  First Order Predicate Logic with Generalized Quantifiers , 1966 .

[14]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[15]  Paul Erdös,et al.  Random Graph Isomorphism , 1980, SIAM J. Comput..

[16]  李幼升,et al.  Ph , 1989 .

[17]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[18]  A. Mostowski.  On a generalization of quantifiers , 1957 .

[19]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[20]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[21]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[22]  S. Abiteboul,et al.  Fixpoint extensions of first-order logic and datalog-like languages , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[23]  Yuri Gurevich,et al.  Toward logic tailored for computational complexity , 1984 .

[24]  Saharon Shelah,et al.  Fixed-Point Extensions of First-Order Logic , 1985, FOCS.

[25]  Saharon Shelah,et al.  On random models of finite power and monadic logic , 1985, Discrete Mathematics.

[26]  Michael M. Richter,et al.  Computation and Proof Theory , 1984 .

[27]  Phokion G. Kolaitis.  Implicit definability on finite structures and unambiguous computations , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[28]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1989, 30th Annual Symposium on Foundations of Computer Science.

[29]  Phokion G. Kolaitis,et al.  Infinitary Logics and 0-1 Laws , 1992, Inf. Comput..

[30]  James F. Lynch.  Infinitary logics and very sparse random graphs , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[31]  Richard M. Karp,et al.  Complexity of Computation , 1974 .

[32]  Ronald Fagin,et al.  Monadic generalized spectra , 1975, Math. Log. Q..

[33]  A. Dawar,et al.  Infinitary Logic and Inductive Definability over Finite Structures , 1995, Inf. Comput..

[34]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).