Key points are not available for this paper at this time.
We investigate the ability of a free pro-Formula: see text group of infinite rank to abstractly solve abstract embedding problems, and conclude that for some varieties Formula: see text, the profinite completion of any order, of a free pro-Formula: see text group of infinite rank, is a free pro-Formula: see text group as well, of the corresponding rank.
Tamar Bar-On (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: