Undecidability of the word problem in relatively free rings / Popov VY // MATHEMATICAL NOTES. - 2000. - V. 67, l. 3-4. - P. 495-504.

ISSN/EISSN:

0001-4346 / нет данных

Type:

Article

Abstract:

An example of a series of varieties of rings X-p with the finite basis property is constructed for which the word problem in the relatively free ring FnXp of rank n in the variety X-p is decidable if and only if n < p.

Author keywords:

undecidable theory; word problem; equational theory variety of rings; finite basis property; relatively free ring; recursive set; recursively enumerable set

DOI:

10.1007/BF02676406

Web of Science ID:

ISI:000087512400029

Соавторы в МНС:

—

Другие поля

Поле	Значение
Month	MAR-APR
Publisher	PLENUM PUBL CORP
Address	CONSULTANTS BUREAU, 233 SPRING ST, NEW YORK, NY 10013 USA
Language	English
Research-Areas	Mathematics
Web-of-Science-Categories	Mathematics
ResearcherID-Numbers	Popov, Vladimir/J-1440-2012 Popov, Vladimir/C-9868-2015
ORCID-Numbers	Popov, Vladimir/0000-0001-9671-681X
Number-of-Cited-References	2
Usage-Count-Last-180-days	1
Usage-Count-Since-2013	19
Journal-ISO	Math. Notes
Doc-Delivery-Number	322MB