Kazan Federal University Digital Repository

Isolation from Side in 2-Computably Enumerable Degrees

Show simple item record

dc.contributor.author Yamaleev M.M.
dc.date.accessioned 2021-02-25T20:37:56Z
dc.date.available 2021-02-25T20:37:56Z
dc.date.issued 2020
dc.identifier.issn 1066-369X
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/162111
dc.description.abstract © 2020, Allerton Press, Inc. In this work we consider isolation from side in different degree structures, in particular, in the 2-computably enumerable wtt-degrees and in low Turing degrees. Intuitively, a 2-computably enumerable degree is isolated from side if all computably enumerable degrees from its lower cone are bounded from above by some computably enumerable degree which is incomparable with the given one. It is proved that any properly 2-computably enumerable wtt-degree is isolated from side by some computable enumerable wtt-degree. Also it is shown that the same result holds for the low 2-computable enumerable Turing degrees.
dc.relation.ispartofseries Russian Mathematics
dc.subject 2-computably enumerable set
dc.subject isolation from side
dc.subject Turing degree
dc.subject wtt-degree
dc.title Isolation from Side in 2-Computably Enumerable Degrees
dc.type Article
dc.relation.ispartofseries-issue 8
dc.relation.ispartofseries-volume 64
dc.collection Публикации сотрудников КФУ
dc.relation.startpage 70
dc.source.id SCOPUS1066369X-2020-64-8-SID85090015072

Files in this item

This item appears in the following Collection(s)

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

Show simple item record

Search DSpace

Advanced Search


My Account