Undecidability of the word problem in relatively free rings

V. Popov

doi:10.1007/BF02676406

Undecidability of the word problem in relatively free rings

Результат исследований: Вклад в журнал › Статья

Язык оригинала	Английский
Страницы (с-по)	495-504
Число страниц	10
Журнал	Mathematical Notes
Том	67
Номер выпуска	3-4
DOI	https://doi.org/10.1007/BF02676406
Состояние	Опубликовано - 2000

Предметные области WoS

Математика

Ссылки

10.1007/BF02676406

https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=tsmetrics&SrcApp=tsm_test&DestApp=WOS_CPL&DestLinkType=FullRecord&KeyUT=000087512400029

Цитировать

@article{de49cf683d2544d5a10ab5f5601c3d4f,

title = "Undecidability of the word problem in relatively free rings",

keywords = "undecidable theory, word problem, equational theory variety of rings, finite basis property, relatively free ring, recursive set, recursively enumerable set",

author = "V. Popov",

year = "2000",

doi = "10.1007/BF02676406",

language = "English",

volume = "67",

pages = "495--504",

journal = "Mathematical Notes",

issn = "0001-4346",

publisher = "Kluwer Academic/Plenum Publishers",

number = "3-4",

}

TY - JOUR

T1 - Undecidability of the word problem in relatively free rings

AU - Popov, V.

PY - 2000

Y1 - 2000

KW - undecidable theory

KW - word problem

KW - equational theory variety of rings

KW - finite basis property

KW - relatively free ring

KW - recursive set

KW - recursively enumerable set

UR - https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=tsmetrics&SrcApp=tsm_test&DestApp=WOS_CPL&DestLinkType=FullRecord&KeyUT=000087512400029

U2 - 10.1007/BF02676406

DO - 10.1007/BF02676406

M3 - Article

VL - 67

SP - 495

EP - 504

JO - Mathematical Notes

JF - Mathematical Notes

SN - 0001-4346

IS - 3-4

ER -