| 摘要: |
| 证明存在一个保持最大元1的可计算枚举高度的钻石格. |
| 关键词: 可计算性理论,可计算枚举度,可计算枚举度,Turing归约(图灵归约),相对可计算性. |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学基金，No.69973048；国家863高科技项目基金，No.863-306-05-09-2B，中国科学院青年基金 |
|
| A High Diamond Theorem |
|
Li Ang-sheng,Yang Dong-ping
|
| Abstract: |
| It is shown that there exists a diamond of high computably enumerable degrees preserving the greatest element 1. |
| Key words: Computability theory, computably enumerable set, computably enumerable degree, Turing reducibility, relative computability. |
