Locality and modular Ehrenfeucht–Fraïssé games

Journal of Applied Logic 10 (1):144-162 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,438

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

On complexity of Ehrenfeucht–Fraïssé games.Bakhadyr Khoussainov & Jiamou Liu - 2010 - Annals of Pure and Applied Logic 161 (3):404-415.
On Ehrenfeucht-fraïssé equivalence of linear orderings.Juha Oikkonen - 1990 - Journal of Symbolic Logic 55 (1):65-73.
An Ehrenfeucht‐Fraïssé game for Lω1ω.Jouko Väänänen & Tong Wang - 2013 - Mathematical Logic Quarterly 59 (4-5):357-370.
An Ehrenfeucht‐Fraïssé class game.Wafik Boulos Lotfallah - 2004 - Mathematical Logic Quarterly 50 (2):179-188.
On non-determined Ehrenfeucht-fraïssé games and unstable theories.Tapani Hyttinen & T. Hyttinen - 1992 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):399-408.
On potential isomorphism and non-structure.Taneli Huuskonen, Tapani Hyttinen & Mika Rautila - 2004 - Archive for Mathematical Logic 43 (1):85-120.
Ehrenfeucht games and ordinal addition.Françoise Maurin - 1997 - Annals of Pure and Applied Logic 89 (1):53-73.
Game-based notions of locality over finite models.Marcelo Arenas, Pablo Barceló & Leonid Libkin - 2008 - Annals of Pure and Applied Logic 152 (1-3):3-30.

Analytics

Added to PP
2016-06-30

Downloads
6 (#1,443,383)

6 months
2 (#1,221,975)

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

Model-theoretic methods in the study of elementary logic.William Hanf - 1965 - Journal of Symbolic Logic 34 (1):132--145.
On winning Ehrenfeucht games and monadic NP.Thomas Schwentick - 1996 - Annals of Pure and Applied Logic 79 (1):61-92.
A model-theoretic characterisation of clique width.Achim Blumensath - 2006 - Annals of Pure and Applied Logic 142 (1):321-350.
The Computational Complexity of Logical Theories.Dirk Siefkes - 1984 - Journal of Symbolic Logic 49 (2):670-671.

Add more references