On the word problem and the conjugacy problem for groups of the form \(F/V(R)\) (Q1273995)

Let \(F\) be a free group with a finite or countable set of free generators \(X\). Further, let \(R\) be a normal subgroup of \(F\) and \(\mathcal V\) a group variety different from the variety of all groups. Denote by \(V(R)\) the verbal subgroup of \(R\) corresponding to \(\mathcal V\). Theorem 1 states that the word problem in \(F/V(R)\) is solvable if and only if this problem is solvable in \(F/R\). Theorem 2 states that if \(| X|\geq 3\) then there exists \(R\) such that the conjugacy problem in \(F/R\) is solvable while this problem is unsolvable in \(F/V(R)\) for every non-trivial Abelian variety \(\mathcal V\). (In both theorems algorithmic problems are regarded with respect to images of \(X\) under the corresponding natural epimorphisms.) Theorems 1 and 2 give, respectively, the affirmative answer to Problem 12.98a and the negative answer to Problems 12.98b,c from The Kourovka Notebook: Unsolved Problems in Group Theory [12th ed., Novosibirsk (1992; Zbl 0831.20003)].