Kazan Federal University Digital Repository

A semilattice generated by superlow computably enumerable degrees

Show simple item record

dc.contributor.author Faizrakhmanov M.
dc.date.accessioned 2018-09-18T20:16:50Z
dc.date.available 2018-09-18T20:16:50Z
dc.date.issued 2011
dc.identifier.issn 1066-369X
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/138243
dc.description.abstract We prove that a partially ordered set of all computably enumerable (c. e.) degrees that are the least upper bounds of two superlow c. e. degrees is an upper semilattice not elementary equivalent to the semilattice of all c. e. degrees.© Allerton Press, Inc., 2011.
dc.relation.ispartofseries Russian Mathematics
dc.subject Critical triples
dc.subject Low degrees
dc.subject Superlow degrees
dc.subject Totally c. e. degrees
dc.title A semilattice generated by superlow computably enumerable degrees
dc.type Article
dc.relation.ispartofseries-issue 1
dc.relation.ispartofseries-volume 55
dc.collection Публикации сотрудников КФУ
dc.relation.startpage 74
dc.source.id SCOPUS1066369X-2011-55-1-SID79952848941


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