中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
bounding computably enumerable degrees in the ershov hierarchy

文献类型:期刊论文

作者Li AS ; Wu GH ; Yang Y
刊名ANNALS OF PURE AND APPLIED LOGIC
出版日期2006
卷号141期号:1-2页码:79-88
关键词computably enumerable degrees highness Ershov hierarchy
ISSN号0168-0072
学科主题Mathematics ; Applied; Mathematics
收录类别SCI
公开日期2011-07-13
附注Lachlan observed that any nonzero d.c.e. degree bounds a nonzero c.e. degree. In this paper, we study the c.e. predecessors of d.c.e. degrees, and prove that given a nonzero d.c.e. degree a, there is a c.e. degree b below a and a high d.c.e. d
源URL[http://124.16.136.157/handle/311060/11452]  
专题软件研究所_互联网软件技术实验室 _期刊论文
推荐引用方式
GB/T 7714
Li AS,Wu GH,Yang Y. bounding computably enumerable degrees in the ershov hierarchy[J]. ANNALS OF PURE AND APPLIED LOGIC,2006,141(1-2):79-88.
APA Li AS,Wu GH,&Yang Y.(2006).bounding computably enumerable degrees in the ershov hierarchy.ANNALS OF PURE AND APPLIED LOGIC,141(1-2),79-88.
MLA Li AS,et al."bounding computably enumerable degrees in the ershov hierarchy".ANNALS OF PURE AND APPLIED LOGIC 141.1-2(2006):79-88.

入库方式: OAI收割

来源:软件研究所

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

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