An Ehrenfeucht‐Fraïssé class game

Mathematical Logic Quarterly 50 (2):179-188 (2004)
  Copy   BIBTEX

Abstract

This paper introduces a new Ehrenfeucht-Fraïssé type game that is played on two classes of models rather than just two models. This game extends and generalizes the known Ajtai-Fagin game to the case when there are several alternating moves played in different models. The game allows Duplicator to delay her choices of the models till the very end of the game, making it easier for her to win. This adds on the toolkit of winning strategies for Duplicator in Ehrenfeucht-Fraïssé type games and opens up new methods for tackling some open problems in descriptive complexity theory. As an application of the class game, it is shown that, if m is a power of a prime, then first order logic augmented with function quantifiers F1n of arity 1 and height n < m can not express that the size of the model is divisible by m. This, together with some new expressibility results for Henkin quantifiers H1n gives some new separation results on the class of finite models among various F1n on one hand and between F1n and H1n on the other. Since function quantifiers involve a bounded type of second order existential quantifiers, the class game solves an open problem raised by Fagin, which asks for some inexpressibility result using a winning strategy by Duplicator in a game that involves more than one coloring round

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,296

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

An Ehrenfeucht-Fraisse class game.Wafik Lotfallah - 2004 - Mathematical Logic Quarterly 50 (2):179-188.
Comparing the power of games on graphs.Ronald Fagin - 1997 - Mathematical Logic Quarterly 43 (4):431-455.
An Ehrenfeucht‐Fraïssé game for Lω1ω.Jouko Väänänen & Tong Wang - 2013 - Mathematical Logic Quarterly 59 (4-5):357-370.
On winning Ehrenfeucht games and monadic NP.Thomas Schwentick - 1996 - Annals of Pure and Applied Logic 79 (1):61-92.
On complexity of Ehrenfeucht–Fraïssé games.Bakhadyr Khoussainov & Jiamou Liu - 2010 - Annals of Pure and Applied Logic 161 (3):404-415.

Analytics

Added to PP
2013-11-03

Downloads
6 (#1,485,580)

6 months
57 (#86,857)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Finite partially-ordered quantification.Wilbur John Walkoe Jr - 1970 - Journal of Symbolic Logic 35 (4):535-555.
Finite partially-ordered quantification.Wilbur John Walkoe - 1970 - Journal of Symbolic Logic 35 (4):535-555.
Monadic generalized spectra.Ronald Fagin - 1975 - Mathematical Logic Quarterly 21 (1):89-96.

View all 8 references / Add more references