|
|||||
|
|
Undecidability of the word problem in relatively free rings |
|
| Authors: | V Yu Popov |
| Institution: | (1) Ural State Technical University, USSR |
| Abstract: | An example of a series of varieties of rings
with the finite basis property is constructed for which the word problem in the relatively free ring
of rankn in the variety
is decidable if and only ifn <p.
Translated fromMatematicheskie Zametki, Vol. 67, No. 4, pp. 582–594, April, 2000. |
| Keywords: | undecidable theory word problem equational theory variety of rings finite basis property relatively free ring recursive set recursively enumerable set |
| 本文献已被 SpringerLink 等数据库收录！ | |