Cupping the Recursively Enumerable Degrees by D.R.E. Degrees |
| |
| Authors: | Li Angsheng; Yi Xiaoding |
| |
| Institution: | Institute of Software, Chinese Academy of Sciences Beijing, 100080, China E-mail: liang{at}ox.ios.ac.cn
University of Leeds, University of Connecticut |
| |
| Abstract: | We prove that there are two incomplete d.r.e. degrees (the Turingdegrees of differences of two recursively enumerable sets) suchthat every non-zero recursively enumerable degree cups at leastone of them to 0', the greatest recursively enumerable (Turing)degree. 1991 Mathematics Subject Classification: primary 03D25,03D30; secondary 03D35. |
| |
| Keywords: | |
| 本文献已被 Oxford 等数据库收录！ |
|
