Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Generalized quantifiers for simple properties

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Otto, M. ; Math. Grundlagen der Inf., Tech. Hochschule Aachen, Germany

We consider extensions of fixed-point logic by means of generalized quantifiers in the context of descriptive complexity. By the well-known theorem of N. Immerman and M. Vardi, fixed-point logic captures PTime over linearly ordered structures. It fails, however, to express even most fundamental structural properties, like simple cardinality properties, in the absence of order. We concentrate on extensions by generalized quantifiers which serve to adjoin simple or basic structural properties. An abstract notion of simplicity is put forward which isolates those structural properties, that can be characterized in terms of a concise structural invariant. The key examples are provided by all monadic and cardinality properties in a very general sense. The main theorem establishes that no extension by any family of such simple quantifiers can cover all of PTime. These limitations are proved on the basis of the semantically motivated notion of simplicity; in particular there is no implicit bound on the arities of the generalized quantifiers involved. Quite to the contrary, the natural applications concern infinite families of quantifiers adjoining certain structural properties across all arities in a uniform way

Published in:

Logic in Computer Science, 1994. LICS '94. Proceedings., Symposium on

Date of Conference:

4-7 Jul 1994