A join theorem for the computably enumerable degrees
文献类型：期刊论文
| 作者 | Jockusch CG ; Li AS ; Yang Ye |
| 刊名 | Transactions of the American Mathematical Society
 |
| 出版日期 | 2004 |
| 卷号 | 356期号:7页码:2557-2568 |
| 关键词 | join theorem computably enumerable degree definable ideals Turing jump |
| 通讯作者 | Jockusch ; CG (通讯作者) ; Univ Illinois ; Dept Math ; 1409 W Green St ; Urbana ; IL 61801 USA |
| 收录类别 | SCI |
| 公开日期 | 2010-08-23 |
| 附注 | 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. Cholak； M. Groszek and T. Slaman that the low and low(2) c.e. degrees are not elementarily equivalent as partial orderings. |
| 源URL | [http://124.16.136.157/handle/311060/3814]  |
| 专题 | 软件研究所_基础软件国家工程研究中心_期刊论文 |
| 推荐引用方式 GB/T 7714 | Jockusch CG,Li AS,Yang Ye. 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 Ye.(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
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。