RelatioR/M中的与 R中的≤_T的关系(英文)

Relation ofin R/M and ≤_T in R

证明存在递归可枚举图灵度 a和 c使得 c a,并且对每个递归可枚举图灵度 b≤ Ta,b≠ c,其中 a是 R/M中的一个元素 ,R/ M是递归可枚举图灵度集 R模可盖图灵度集 M的商 .

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.