The expressive power of finitely many generalized quantifiers

We consider extensions of first order logic (FO) and fixed [Bpoint logic (FP) by means of generalized quantifiers in the sense of P. Lindstrom (1966). We show that adding a finite set of such quantifiers to FP fails to capture PTIME, even over a fixed signature. We also prove a stronger version of this result for PSPACE, which enables us to establish a weak version of a conjecture formulated previously by Ph.G. Kolaitis and M.Y. Vardi (1992). These results are obtained by defining a notion of element type for bounded variable logics with finitely many generalized quantifiers. Using these, we characterize the classes of finite structures over which the infinitary logic L/sub /spl infin/wsup w/ extended by a finite set of generalized quantifiers Q and is no more expressive than first order logic extended by the quantifiers in Q.<<ETX>>

[1]  Bruno Poizat.  Deux Ou Trois Choses Que je Sais de Ln , 1982, J. Symb. Log..

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

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

[4]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1992, Comb..

[5]  Lauri Hella,et al.  Definability Hierarchies of Generalized Quantifiers , 1989, Ann. Pure Appl. Log..

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

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

[8]  Lauri Hella,et al.  Logical hierarchies in PTIME , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[9]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

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

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

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

[13]  Serge Abiteboul,et al.  Datalog Extensions for Database Queries and Updates , 1991, J. Comput. Syst. Sci..

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

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

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

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

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