Fixpoint logic vs. infinitary logic in finite-model theory

The relationship between fixpoint logic and the infinitary logic L/sub infinity omega //sup omega / with a finite number of variables is studied. It is observed that the equivalence of two finite structures with respect to L/sub infinity omega //sup omega / is expressible in fixpoint logic. As a first application of this, a normal-form theorem for L infinity /sub omega //sup omega / on finite structures is obtained. The relative expressive power of first-order logic, fixpoint logic, and L/sub infinity omega //sup omega / on arbitrary classes of finite structures is examined. A characterization of when L/sub infinity omega //sup omega / collapses to first-order logic on an arbitrary class of finite structures is given.<<ETX>>

[1]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[2]  Phokion G. Kolaitis,et al.  The decision problem for the probabilities of higher-order properties , 1987, STOC.

[3]  Neil Immerman.  Upper and lower bounds for first order expressibility , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[4]  Haim Gaifman,et al.  Decidable optimization problems for database logic programs , 1988, STOC '88.

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

[6]  Serge Abiteboul,et al.  Generic Computation and its complexity , 1991, STOC '91.

[7]  Saharon Shelah,et al.  Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

[9]  Neil Immerman,et al.  On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[10]  Jerzy Tyszkiewicz.  Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue Logic , 1991, CSL.

[11]  Phokion G. Kolaitis,et al.  On the expressive power of datalog: tools and a case study , 1990, J. Comput. Syst. Sci..

[12]  Phokion G. Kolaitis.  On Asymptotic Probability of Inductive Queries and Their Decision Problem , 1985, Logic of Programs.

[13]  Harry G. Mairson,et al.  Undecidable optimization problems for database logic programs , 1993, JACM.

[14]  K. Compton.  Laws in Logic and Combinatorics , 1989 .

[15]  Jeffrey F. Naughton,et al.  Data independent recursion in deductive databases , 1985, J. Comput. Syst. Sci..

[16]  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.

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

[18]  Serge Abiteboul,et al.  Database theory column , 1989, SIGA.

[19]  Laks V. S. Lakshmanan,et al.  Inductive pebble games and the expressive power of datalog , 1989, PODS '89.

[20]  E. Lander,et al.  Describing Graphs: A First-Order Approach to Graph Canonization , 1990 .

[21]  Ashok K. Chandra.  Theory of database queries , 1988, PODS '88.

[22]  Yiannis N. Moschovakis,et al.  Elementary induction on abstract structures , 1974 .

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

[24]  Yuri Gurevich,et al.  Datalog vs. first-order logic , 1989, 30th Annual Symposium on Foundations of Computer Science.

[25]  N. Immerman,et al.  On uniformity within NC 1 . , 1988 .

[26]  Michel de Rougemont.  Second-order and Inductive Definability on Finite Structures , 1987, Math. Log. Q..

[27]  Jerzy Tyszkiewicz.  Infinitary Queries and Their Asymptotic Probabilites II. Properties Definable in Least Fixed Point Logic , 1994, Random Struct. Algorithms.

[28]  K. Jon Barwise,et al.  On Moschovakis closure ordinals , 1977, Journal of Symbolic Logic.

[29]  Steven Lindell.  The Invariant Problem for Binary String Structures and the Parallel Complexity Theory of Queries , 1992, J. Comput. Syst. Sci..

[30]  Phokion G. Kolaitis,et al.  0-1 laws for infinitary logics , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[31]  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.

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

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

[34]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[35]  Gregory L. McColm.  When Is Arithmetic Possible? , 1990, Ann. Pure Appl. Log..

[36]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[37]  Saharon Shelah,et al.  Threshold spectra for random graphs , 1987, STOC '87.