Irreducible, Singular, and Contiguous Degrees

dc.contributor.author	Batyrshin I.
dc.date.accessioned	2018-04-05T07:08:49Z
dc.date.available	2018-04-05T07:08:49Z
dc.date.issued	2017
dc.identifier.issn	0002-5232
dc.identifier.uri	http://dspace.kpfu.ru/xmlui/handle/net/129357
dc.description.abstract	© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic reducibilities inside the degrees of weaker algorithmic ones. Results in this area are reviewed for algorithmic reducibilities m-, 1-, tt-, wtt-, T-, e-, s-, Q-, and we formulate questions that are still not settled for these. A computably enumerable Q-degree which consists of one computably enumerable m-degree is constructed.
dc.relation.ispartofseries	Algebra and Logic
dc.subject	computably enumerable degrees
dc.subject	contiguous degrees
dc.subject	irreducible degrees
dc.subject	m-reducibility
dc.subject	Q-reducibility
dc.subject	singular degrees
dc.title	Irreducible, Singular, and Contiguous Degrees
dc.type	Article
dc.relation.ispartofseries-issue	3
dc.relation.ispartofseries-volume	56
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	181
dc.source.id	SCOPUS00025232-2017-56-3-SID85030674764

Files in this item

Size: 87.53Kb

Format: PDF

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