DocumentCode :
2894226
Title :
Generalized quantifiers and pebble games on finite structures
Author :
Kolaitis, Phokion G. ; Väänänen, Jouko A.
Author_Institution :
Comput. & Inf. Sci., California Univ., Santa Cruz, CA, USA
fYear :
1992
fDate :
22-25 Jun 1992
Firstpage :
348
Lastpage :
359
Abstract :
Generalized quantifiers in the realm of finite structures are studied and combined with an infinitary logic L∞ωω 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
Keywords :
finite automata; formal logic; game theory; Ehrenfeucht-Fraisse games; combinatorial tools; finite model theory; finite structures; generalized quantifiers; infinitary logic; pebble games; polynomial-time properties; time-theoretic characterization; Computer science; Game theory; Logic; Mathematics; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Logic in Computer Science, 1992. LICS '92., Proceedings of the Seventh Annual IEEE Symposium on
Conference_Location :
Santa Cruz, CA
Print_ISBN :
0-8186-2735-2
Type :
conf
DOI :
10.1109/LICS.1992.185547
Filename :
185547
Link To Document :
بازگشت