Generalized quantifiers and pebble games on finite structures

Abstract

Generalized quantifiers in the realm of finite structures are studied and combined with an infinitary logic L/sub infinity omega //sup omega / to obtain new logics that can be used to express polynomial-time properties that are not definable in the original logic. It is shown that equivalence of finite structures relative to the new logics can be characterized in terms of certain pebble games that are a variant of the Ehrenfeucht-Fraisse games. This time-theoretic characterization is combined with sophisticated combinatorial tools in order to investigate the scopes and limits of generalized quantifiers in finite model theory.<>