摘要
运用关键点编码技巧构造性地证明了在递归可枚举度集中,对任给的非递归的递归可枚举度d,存在可盖的递归可枚举度 a 和递归可枚举度 c 满足 dc,并且有 d≤a∪ .
Useing the method of key-point coding,this paper gives out a constructing proof of the result that for any nonrecursive r.e.degree d,there is a r.e.degree c and cappable r.e.degree a such that dc and d≤a∪.
