a join theorem for the computably enumerable degrees
文献类型：期刊论文
| 作者 | Jockusch CG ; Li AS ; Yang Y |
| 刊名 | TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
 |
| 出版日期 | 2004 |
| 卷号 | 356期号:7页码:2557-2568 |
| 关键词 | join theorem computably enumerable degree definable ideals Turing jump |
| ISSN号 | 0002-9947 |
| 学科主题 | Mathematics |
| 收录类别 | SCI |
| 语种 | 英语 |
| 公开日期 | 2011-07-29 |
| 附注 | It is shown that for any computably enumerable (c.e.) degree w, if w not equal 0, then there is a c. e. degree a such that (a boolean OR w) = a" = 0" (so a is low(2) and aboolean ORw is high). It follows from this and previous work of P. Chola |
| 源URL | [http://124.16.136.157/handle/311060/12928]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Jockusch CG,Li AS,Yang Y. a join theorem for the computably enumerable degrees[J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY,2004,356(7):2557-2568. |
| APA | Jockusch CG,Li AS,&Yang Y.(2004).a join theorem for the computably enumerable degrees.TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY,356(7),2557-2568. |
| MLA | Jockusch CG,et al."a join theorem for the computably enumerable degrees".TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY 356.7(2004):2557-2568. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。