On the Problem of Definability of the Computably Enumerable Degrees in the Difference Hierarchy

dc.contributor.author	Arslanov M.
dc.contributor.author	Yamaleev M.
dc.date.accessioned	2019-01-22T20:51:36Z
dc.date.available	2019-01-22T20:51:36Z
dc.date.issued	2018
dc.identifier.issn	1995-0802
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/149133
dc.description.abstract	© 2018, Pleiades Publishing, Ltd. Questions of definability of computably enumerable degrees in the difference hierarchy (degrees of sets from finite levels of the Ershov difference hierarchy) are studied. Several approaches to the solution of this problem are outlined.
dc.relation.ispartofseries	Lobachevskii Journal of Mathematics
dc.subject	definable relations
dc.subject	Difference hierarchy
dc.subject	structural properties
dc.subject	Turing degrees
dc.title	On the Problem of Definability of the Computably Enumerable Degrees in the Difference Hierarchy
dc.type	Article
dc.relation.ispartofseries-issue	5
dc.relation.ispartofseries-volume	39
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	634
dc.source.id	SCOPUS19950802-2018-39-5-SID85049560640

Files in this item

Size: 420.2Kb

Format: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.