Embedding Theorems for Countable Groups

Abstract

A group P is said to be a CEF-group if, for every countable group G, there is a factor group of P which contains a subgroup isomorphic to G. It was shown by Higman, Neumann, and Neumann [5] that the free group of rank two is a CEF-group. More recently, Levin [6] proved that if P is the free product of two cyclic groups, not both of order two, then P is a CEF-group. Later, Hall [3] gave an alternative proof of Levin's result.In this paper we give a new proof of Levin's result (Theorem 2). The proof given yields information about the factor group H of P in which a given countable group G is embedded; for example, if G is given by a recursive presentation (this concept is denned in [4]), then a recursive presentation is obtained for H, and certain decision problems (in particular, the word problem) are solvable for the recursive presentation obtained for H if and only if they are solvable for the given recursive presentation of G.