Undecidability of the word problem in relatively free rings (Q1585640)
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: Undecidability of the word problem in relatively free rings |
scientific article; zbMATH DE number 1531341
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Undecidability of the word problem in relatively free rings |
scientific article; zbMATH DE number 1531341 |
Statements
Undecidability of the word problem in relatively free rings (English)
0 references
16 November 2000
0 references
For any natural \(p>0\), a finitely based variety of nonassociative rings \(X_p\) over a field of characteristic 2 is constructed for which the word problem in a relatively free ring \(F_n(X_p)\) of rank \(n\) is decidable if and only if \(n<p\). The construction and the proof is rather technical and tricky.
0 references
finitely based variety of nonassociative rings
0 references
word problem
0 references
relatively free rings
0 references
equational theory
0 references
