On non-determined Ehrenfeucht-fraïssé games and unstable theories

&
Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):399-408 (1992)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19920380138

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,283

External links

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

Through your library

My notes

Similar books and articles

On non‐determined ehrenfeucht‐fraïssé games and unstable theories.Tapani Hyttinen & T. Hyttinen - 1992 - Mathematical Logic Quarterly 38 (1):399-408.
On Ehrenfeucht-fraïssé equivalence of linear orderings.Juha Oikkonen - 1990 - Journal of Symbolic Logic 55 (1):65-73.
On complexity of Ehrenfeucht–Fraïssé games.Bakhadyr Khoussainov & Jiamou Liu - 2010 - Annals of Pure and Applied Logic 161 (3):404-415.
Computational complexity of logical theories of one successor and another unary function.Pascal Michel - 2007 - Archive for Mathematical Logic 46 (2):123-148.
On potential isomorphism and non-structure.Taneli Huuskonen, Tapani Hyttinen & Mika Rautila - 2004 - Archive for Mathematical Logic 43 (1):85-120.
Games on Trees and Syntactical Complexity of Formulas.Michał Krynicki & Jose Maria Turull Torres - 2007 - Logic Journal of the IGPL 15 (5-6):653-687.
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.
Ehrenfeucht games and ordinal addition.Françoise Maurin - 1997 - Annals of Pure and Applied Logic 89 (1):53-73.
A first-order axiomatization of the theory of finite trees.Rolf Backofen, James Rogers & K. Vijay-Shanker - 1995 - Journal of Logic, Language and Information 4 (1):5-39.
An Application of Games to the Completeness Problem for Formalized Theories.A. Ehrenfeucht - 1967 - Journal of Symbolic Logic 32 (2):281-282.
Review: A. Ehrenfeucht, An Application of Games to the Completeness Problem for Formalized Theories. [REVIEW]Erwin Engeler - 1967 - Journal of Symbolic Logic 32 (2):281-282.
Review: Solomon Feferman, Some Recent Work of Ehrenfeucht and Fraisse. [REVIEW]Erwin Engeler - 1967 - Journal of Symbolic Logic 32 (2):282-282.
A local normal form theorem for infinitary logic with unary quantifiers.H. Jerome Keisler & Wafik Boulos Lotfallah - 2005 - Mathematical Logic Quarterly 51 (2):137-144.
The complexity of countable categoricity in finite languages.Aleksander Ivanov - 2012 - Mathematical Logic Quarterly 58 (1-2):105-112.

Analytics

Added to PP
2016-02-04

Downloads
32 (#502,794)

6 months
3 (#984,114)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Games and trees in infinitary logic: A survey.Jouko Väänänen - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 105--138.

Add more citations

References found in this work

No references found.

Add more references