Skip to main content Accessibility help
×
Home

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

  • ANGSHENG LI (a1) and XIAODING YI (a2)

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.

Copyright

Related content

Powered by UNSILO

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

  • ANGSHENG LI (a1) and XIAODING YI (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.