| 摘要: |
| 证明存在递归可枚举图灵度a和c使得ca,并且对每个递归可枚举图灵度b≤Ta, b≠c, 其中a是R/M中的一个元素，R/M是递归可枚举图灵度集R模可盖图灵度集M的商. |
| 关键词: 递归可枚举度，弱真值表归约. |
| DOI： |
| 分类号: |
| 基金项目:This research is supported by the National Natural Science Foundation of China(国家自然科学基金,No.69673017). |
|
| Relation of in R/M and ≤T in R |
|
SUI Yue-fei
|
| 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. |
| Key words: Recursively enumerable degree, weak truth table reduction. |
