###
DOI:
Journal of Software:2000.11(6):745-750

R/M中的与R中的≤T的关系
眭跃飞
(中国科学院软件研究所,北京,100080)
Relation of in R/M and ≤T in R
SUI Yue-fei
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 1985   Download 2318
Received:July 03, 1998    Revised:December 15, 1998
> 中文摘要: 证明存在递归可枚举图灵度a和c使得ca,并且对每个递归可枚举图灵度b≤Ta, b≠c, 其中a是R/M中的一个元素,R/M是递归可枚举图灵度集R模可盖图灵度集M的商.
Abstract:It is proved that there are r.e. degrees a and c such that [c]<[a] and [b]≠[c] for any r.e. degree b≤T a, where [a] is an element of R/M, the quotient of the recursively enumerable degrees R modulo the cappable degrees M.
文章编号:     中图分类号:    文献标志码:
基金项目:This research is supported by the National Natural Science Foundation of China(国家自然科学基金,No.69673017). This research is supported by the National Natural Science Foundation of China(国家自然科学基金,No.69673017).
Foundation items:
Reference text:

眭跃飞.R/M中的与R中的≤T的关系.软件学报,2000,11(6):745-750

SUI Yue-fei.Relation of in R/M and ≤T in R.Journal of Software,2000,11(6):745-750