期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Modulo computably enumerable degrees by cupping partners
1
作者 Wei WANG De-cheng DING 《Science China Mathematics》 SCIE 2007年第6期899-912,共14页
Cupping partners of an element in an upper semilattice with a greatest element 1 are those joining the element to 1. We define a congruence relation on such an upper semilattice by considering the elements having the ... Cupping partners of an element in an upper semilattice with a greatest element 1 are those joining the element to 1. We define a congruence relation on such an upper semilattice by considering the elements having the same cupping partners as equivalent. It is interesting that this congruence relation induces a non-dense quotient structure of computably enumerable Turing degrees. Another main interesting phenomenon in this article is that on the computably enumerable degrees, this relation is different from that modulo the noncuppable ideal, though they define a same equivalent class for the computable Turing degree. 展开更多
关键词 Turing degrees computably enumerable cupping partner 03d25
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部