The role of decidability in first order separations over classes of finite structures

We establish that the decidability of the first order theory of a class of finite structures C is a simple and useful condition for guaranteeing that the expressive power of FO+LFP properly extends that of FO on C, unifying separation results for various classes of structures that have been studied. We then apply this result to show that it encompasses certain constructive pebble game techniques which are widely used to establish separations between FO and FO+LFP, and demonstrate that these same techniques cannot succeed in performing separations from any complexity class that contains DLOGTIME.

[1]  Gregory L. McColm,et al.  Parametrization over Inductive Relations of a Bounded Number of Variables , 1990, Ann. Pure Appl. Log..

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

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

[4]  Neil Immerman,et al.  McColm's Conjecture , 1994, LICS 1994.

[5]  Phokion G. Kolaitis,et al.  First-order logic vs. fixed-point logic in finite set theory , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[6]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[7]  Scott Weinstein,et al.  First Order Logic, Fixed Point Logic and Linear Order , 1995, CSL.

[8]  Ronald Fagin,et al.  On Monadic NP vs. Monadic co-NP , 1995, Inf. Comput..

[9]  Phokion G. Kolaitis,et al.  Fixpoint logic vs. infinitary logic in finite-model theory , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[10]  Neil Immerman,et al.  McColm's conjecture [positive elementary inductions] , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

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

[12]  Steven Lindell,et al.  An Analysis of Fixed-Point Queries on Binary Trees , 1991, Theor. Comput. Sci..