中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Nonexistence of minimal pairs in L[d]

文献类型:会议论文

作者Fang, Chengling1; Liu, Jiang2; Wu, Guohua3; Yamaleev, Mars M.4
出版日期2015
会议日期June 29, 2015 - July 3, 2015
会议地点Bucharest, Romania
DOI10.1007/978-3-319-20028-6_18
页码177-185
通讯作者Wu, Guohua (guohua@ntu.edu.sg)
英文摘要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. © Springer International Publishing Switzerland 2015.
会议录11th Conference on Computability in Europe, CiE 2015
语种英语
电子版国际标准刊号16113349
ISSN号03029743
源URL[http://119.78.100.138/handle/2HOD01W0/4816]  
专题中国科学院重庆绿色智能技术研究院
作者单位1.School of Science, Chongqing Jiaotong University, Chongqing, China;
2.Chongqing Institute of Green Intelligent Technology, Chinese Academy of Sciences, Chongqing, China;
3.School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore, Singapore;
4.Institute of Mathematics and Mechanics, Kazan Federal University, Kazan, Russia
推荐引用方式
GB/T 7714
Fang, Chengling,Liu, Jiang,Wu, Guohua,et al. Nonexistence of minimal pairs in L[d][C]. 见:. Bucharest, Romania. June 29, 2015 - July 3, 2015.

入库方式: OAI收割

来源:重庆绿色智能技术研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。