A residually finite associative algebra with an undecidable word problem (Q2729363)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A residually finite associative algebra with an undecidable word problem |
scientific article; zbMATH DE number 1622460
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A residually finite associative algebra with an undecidable word problem |
scientific article; zbMATH DE number 1622460 |
Statements
22 July 2001
0 references
word problem
0 references
associative algebras
0 references
residually finite algebras
0 references
finitely generated algebras
0 references
recursively defined algebras
0 references
commutative rings
0 references
0.9166512
0 references
0.88534343
0 references
0.8743265
0 references
0.87047046
0 references
0.8661308
0 references
0.8639829
0 references
0 references
A residually finite associative algebra with an undecidable word problem (English)
0 references
For any constructive commutative ring \(k\) with unity, the author constructs a series of examples of a residually finite, finitely generated, recursively defined associative \(k\)-algebra with unity whose word problem is undecidable. This answers a question posed by \textit{L.~A.~Bokut'} [Izv. Vyssh. Uchebn. Zaved., Mat. 1982, No. 11(246), 3-11 (1982; Zbl 0513.17001)].
0 references
