Belegradek, O2024-07-182024-07-1820000021-8693https://doi.org/10.1006/jabr.2000.8287https://hdl.handle.net/11411/6952A finitely generated algebra A in a variety V is called finitely determined in V if there exists a finite V-consistent set of equalities and inequalities in an alphabet containing the generating set of A, which, together with the identities of V, yields all relations and non-relations of A. Obviously, if the equational theory of V is recursively enumerable then any finitely determined algebra in V has solvable word problem. The known algebraic characterizations of groups and semigroups with solvable word problem imply that in the varieties of all groups and all semigroups the members with solvable word problem are finitely determined. We construct a finitely generated center-by-metabelian group with solvable word problem, which is not finitely determined in every group variety V with ZU(2) subset of or equal to V subset of or equal to U-3. We show that every extension of a finitely generated abelian group by a finite group from a variety W is finitely determined in every variety V superset of or equal to ZU(2)W. However, in any abelian-by-nilpotent variety no infinite group is finitely determined; moreover, in every variety, in which all finitely presented algebras are residually finite, each finitely determined algebra is finite. In the variety of all associative linear algebras over a finitely generated field every member with solvable word problem is finitely determined. We construct an example, which shows that for the variety of all associative rings it is not true; however, in this variety each torsion-free member with solvable word problem is finitely determined. (C) 2000 Academic Press.eninfo:eu-repo/semantics/openAccessVariety Of AlgebrasFinitely Determined AlgebraExistentially Closed AlgebraWord ProblemCenter-By-Metabelian GroupAssociative RingArticle2-s2.0-003465878310.1006/jabr.2000.82876022Q1586228Q2WOS:000087678800013