Kazan Federal University Digital Repository

Splitting and nonsplitting in the Σ2 0 enumeration degrees

Show simple item record

dc.contributor.author Arslanov M.
dc.contributor.author Cooper S.
dc.contributor.author Kalimullin I.
dc.contributor.author Soskova M.
dc.date.accessioned 2018-09-18T20:08:30Z
dc.date.available 2018-09-18T20:08:30Z
dc.date.issued 2011
dc.identifier.issn 0304-3975
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/136918
dc.description.abstract This paper continues the project, initiated in (Arslanov, Cooper and Kalimullin 2003) [3], of describing general conditions under which relative splittings are derivable in the local structure of the enumeration degrees, for which the Ershov hierarchy provides an informative setting. The main results below include a proof that any high total e-degree below 0e′ is splittable over any low e-degree below it, a non-cupping result in the high enumeration degrees which occurs at a low level of the Ershov hierarchy, and a Combining long solidus overlay‴-priority construction of a Π10e-degree unsplittable over a 3-c.e. e-degree below it. © 2010 Elsevier B.V. All rights reserved.
dc.relation.ispartofseries Theoretical Computer Science
dc.subject Computability
dc.subject Enumeration reducibility
dc.subject Ershov hierarchy
dc.subject Splitting and nonsplitting
dc.title Splitting and nonsplitting in the Σ2 0 enumeration degrees
dc.type Conference Paper
dc.relation.ispartofseries-issue 18
dc.relation.ispartofseries-volume 412
dc.collection Публикации сотрудников КФУ
dc.relation.startpage 1669
dc.source.id SCOPUS03043975-2011-412-18-SID79952455684


Files in this item

This item appears in the following Collection(s)

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

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics