An algebra has a solvable word problem if and only if it is embeddable in a finitely generated simple algebra

DOI10.1007/BF02485389zbMath0381.03029MaRDI QIDQ1247319

Trevor Evans

Publication date: 1978

Published in: Algebra Universalis (Search for Journal in Brave)

Mathematics Subject Classification ID

Word problems, etc. in computability and recursion theory (03D40) Varieties (08B99) Word problems (aspects of algebraic structures) (08A50)

Related Items (2)

Universal algebras ⋮ Efficient solution of the word problem in slim varieties

Cites Work

• Unnamed Item
• Unnamed Item
• Subgroups of finitely presented groups
• An algebraic characterization of groups with soluble word problem

This page was built for publication: An algebra has a solvable word problem if and only if it is embeddable in a finitely generated simple algebra