中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
plus cupping degrees do not form an ideal

文献类型:期刊论文

作者Li AS ; Zhao YC
刊名SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES
出版日期2004
卷号47期号:5页码:635-654
关键词computably enumerable set turing degree definability
ISSN号1009-2757
学科主题Computer Science, Information Systems
收录类别SCI
语种英语
公开日期2011-07-29
附注A computably enumerable (c.e., for short) degree a is called plus cupping, if every c.e. degree x with 0 < x less than or equal to a is cuppable. Let PC be the set of all plus cupping degrees. In the present paper, we show that PC is not close
源URL[http://124.16.136.157/handle/311060/12904]  
专题软件研究所_软件所图书馆_期刊论文
推荐引用方式
GB/T 7714
Li AS,Zhao YC. plus cupping degrees do not form an ideal[J]. SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES,2004,47(5):635-654.
APA Li AS,&Zhao YC.(2004).plus cupping degrees do not form an ideal.SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES,47(5),635-654.
MLA Li AS,et al."plus cupping degrees do not form an ideal".SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES 47.5(2004):635-654.

入库方式: OAI收割

来源:软件研究所

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

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