Show simple item record

dc.contributor.author Fang C.
dc.contributor.author Liu J.
dc.contributor.author Wu G.
dc.contributor.author Yamaleev M.
dc.date.accessioned 2018-09-18T20:08:24Z
dc.date.available 2018-09-18T20:08:24Z
dc.date.issued 2015
dc.identifier.issn 0302-9743
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/136899
dc.description.abstract © Springer International Publishing Switzerland 2015. For a d.c.e. set D with a d.c.e. approximation (Formula presented.), the Lachlan set of D is defined as (Formula presented.). For a d.c.e. degree d, L[d] is defined as the class of c.e. degrees of those Lachlan sets of d.c.e. sets in d. In this paper, we prove that for any proper d.c.e. degree d, no two elements in L[d] can form a minimal pair. This result gives another solution to Ishmukhametov’s problem, which asks whether for any proper d.c.e. degree d, L[d] always has a minimal element. A negative answer to this question was first given by Fang, Wu and Yamaleev in 2013.
dc.relation.ispartofseries Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.title Nonexistence of minimal pairs in L[d]
dc.type Conference Paper
dc.relation.ispartofseries-volume 9136
dc.collection Публикации сотрудников КФУ
dc.relation.startpage 177
dc.source.id SCOPUS03029743-2015-9136-SID84950138415


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