there is no low maximal d. c. e. degree
文献类型：期刊论文
| 作者 | Arslanov M ; Cooper SB ; Li AS |
| 刊名 | MATHEMATICAL LOGIC QUARTERLY
 |
| 出版日期 | 2000 |
| 卷号 | 46期号:3页码:409-416 |
| 关键词 | computably enumerable set n-c. e. set maximal d. c. e. degree |
| ISSN号 | 0942-5616 |
| 学科主题 | Mathematics |
| 收录类别 | SCI |
| 语种 | 英语 |
| 公开日期 | 2011-07-29 |
| 附注 | We show that for any computably enumerable (c. e.) set A and any Delta(2)(0) set L, if L is low and L <(T) A, then there is a c. e. splitting A(0) box with open top A(1) = A such that A(i) + L <(T) A. In particular, if L is low and n-c. e., th |
| 源URL | [http://124.16.136.157/handle/311060/13646]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Arslanov M,Cooper SB,Li AS. there is no low maximal d. c. e. degree[J]. MATHEMATICAL LOGIC QUARTERLY,2000,46(3):409-416. |
| APA | Arslanov M,Cooper SB,&Li AS.(2000).there is no low maximal d. c. e. degree.MATHEMATICAL LOGIC QUARTERLY,46(3),409-416. |
| MLA | Arslanov M,et al."there is no low maximal d. c. e. degree".MATHEMATICAL LOGIC QUARTERLY 46.3(2000):409-416. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。