An economical imbedding theorem is proved for at most a denumerable set of groups of finite or denumerable cardinality without involution in a group with few subgroups. This result is used to solve a series of problems about groups satisfying the descending chain condition for subgroups; in particular, a nondenumerable group with this condition is constructed. Bibliography: 20 titles.
No takes yet. Share an insight, caveat, or question.
Viatcheslav N. Obraztsov (1990) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: