Introduction. This survey is intended to introduce to logicians some notions, methods and theorems in set theory which arose—largely through the work of Saharon Shelah—out of attempts to solve problems in abelian group theory, principally the Whitehead problem and the closely related problem of the existence of almost free abelian groups. While Shelah's first independence result regarding the Whitehead problem used established set-theoretical methods, his later work required new ideas; it is on these that we focus. We emphasize the nature (...) of the new ideas and the historical context in which they arose, and we do not attempt to give precise technical definitions in all cases, nor to include a comprehensive survey of the algebraic results.In fact, very little algebraic background is needed beyond the definitions of group and group homomorphism. Unless otherwise specified, we will use the word “group” to refer to an abelian group, that is, the group operation is commutative. The group operation will be denoted by +, the identity element by 0, and the inverse of a by −a. We shall use na as an abbreviation for a + a + … + a [n times] if n is positive, and na = if n is negative. (shrink)

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. (shrink)

We give a solution stated in the title to problem 3 of part 1 of the problems listed in the book of Eklof and Mekler [2], p. 453. There, in pp. 241-242, this is discussed and proved in some cases. The existence of strongly λ-free ones was proved earlier by the criteria in [5] and [3]. We can apply a similar proof to a large class of other varieties in particular to the variety of (non-commutative) groups.