Almost free groups and long Ehrenfeucht–Fraı̈ssé games

Annals of Pure and Applied Logic 123 (1-3):101-134 (2003)
  Copy   BIBTEX

Abstract

An Abelian group G is strongly λ -free iff G is L ∞, λ -equivalent to a free Abelian group iff the isomorphism player has a winning strategy in an Ehrenfeucht–Fraı̈ssé game of length ω between G and a free Abelian group. We study possible longer Ehrenfeucht–Fraı̈ssé games between a nonfree group and a free Abelian group. A group G is called ε -game-free if the isomorphism player has a winning strategy in an Ehrenfeucht–Fraı̈ssé game of length ε between G and a free Abelian group. We prove in ZFC existence of nonfree ε -game-free groups for many successors of regular cardinals. We also show that the length of the game obtained is very close to the optimal length provable in ZFC alone. On the other hand, assuming existence of a Mahlo cardinal, we sketch a proof that it is consistent to have a very highly game-free still nonfree group. First we present an introduction to basic constructions and then we introduce some results concerning the standard tools for building more complicated groups, namely transversals and λ -systems. It follows that all the constructions generalize to algebras in a fixed variety satisfying the strong construction principle

Links

PhilArchive



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

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

Trees and Ehrenfeucht–Fraı̈ssé games.Stevo Todorčević & Jouko Väänänen - 1999 - Annals of Pure and Applied Logic 100 (1-3):69-97.
On Ehrenfeucht-fraïssé equivalence of linear orderings.Juha Oikkonen - 1990 - Journal of Symbolic Logic 55 (1):65-73.
Ehrenfeucht games and ordinal addition.Françoise Maurin - 1997 - Annals of Pure and Applied Logic 89 (1):53-73.
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.
Two Kinds of Games.Filip Kobiela - 2011 - Acta Universitatis Carolinae Kinanthropologica 47 (1):61-67.
On the generic type of the free group.Rizos Sklinos - 2011 - Journal of Symbolic Logic 76 (1):227 - 234.

Analytics

Added to PP
2014-01-16

Downloads
11 (#1,110,001)

6 months
7 (#411,886)

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

Reflecting stationary sets and successors of singular cardinals.Saharon Shelah - 1991 - Archive for Mathematical Logic 31 (1):25-53.
Incompactness in regular cardinals.Saharon Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (3):195-228.
Undefinability of κ-well-orderings in l∞κ.Juha Oikkonen - 1997 - Journal of Symbolic Logic 62 (3):999 - 1020.

View all 8 references / Add more references