Abstract. Let k ≧ 3 be an integer or k = ∞ and let K be a field. There is a recursive family <img src="/fulltext-image.asp?format=htmlnonpaginated&src=X393252R37351W83_html\13_2005_Article_1235_TeX2GIFIEq1.gif" border="0" alt="$${\left\{ {G_{n} } \right\}}_{{n \in \mathbb{N}}} $$" /> of finitely presented groups Gn over a fixed finite alphabet with solvable word problem such that