On a connection between the word problem and decidability of the equational theory (Q1595492)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a connection between the word problem and decidability of the equational theory |
scientific article |
Statements
On a connection between the word problem and decidability of the equational theory (English)
0 references
12 February 2001
0 references
Given a free algebra \(\mathcal A\), the word problem for \(\mathcal A\) is decidable if and only if the equational theory of the variety generated by \(\mathcal A\) is decidable. For an arbitrary algebra, the situation is more complicated. In the article under review, the author proves that there is a monogenic ring with decidable word problem such that the equational theory of the ring is undecidable.
0 references
decidability
0 references
word problem
0 references
equational theory
0 references
monogenic ring
0 references
