Hostname: page-component-8448b6f56d-xtgtn Total loading time: 0 Render date: 2024-04-20T03:55:44.548Z Has data issue: false hasContentIssue false
  • English
  • Français

CUPPING THE RECURSIVELY ENUMERABLE DEGREES BY D.R.E. DEGREES

Published online by Cambridge University Press:  01 July 1999

ANGSHENG LI  and
XIAODING YI
ANGSHENG LI
Affiliation:
Institute of Software, Chinese Academy of Sciences, Beijing, 100080, China E-mail: liang@ox.ios.ac.cn
XIAODING YI
Affiliation:
School of Mathematics, University of Leeds, Leeds, LS2 9JT, E-mail: angsheng@amsta.leeds.ac.uk
Get access

Abstract

We prove that there are two incomplete d.r.e.\ degrees (the Turing degrees of differences of two recursively enumerable sets) such that every non-zero recursively enumerable degree cups at least one of them to ${\bf 0}′$, the greatest recursively enumerable (Turing) degree.

Type
Research Article
Information
Proceedings of the London Mathematical Society , Volume 79 , Issue 1 , July 1999 , pp. 1 - 21
Copyright
London Mathematical Society 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)