Skip to main content Accessibility help
×
Home

Restricted jump interpolation in the d.c.e. degrees

  • ANGSHENG LI (a1)

Abstract

We show that for any 2-computably enumerable Turing degree ${\bf l}$, any computably enumerable degree ${\bf a}$ and any Turing degree ${\bf s}$, if ${\bf l'=\boldsymbol{0}'}$, ${\bf l<a}$, ${\bf s\geq \boldsymbol{0}'}$, and ${\bf s}$ is c.e. in ${\bf a}$, then there is a 2-computably enumerable degree ${\bf x}$ with the following properties:

  1. ${\bf l<x<a}$; and
  2. ${\bf x'=s}$
.

Copyright

Related content

Powered by UNSILO

Restricted jump interpolation in the d.c.e. degrees

  • ANGSHENG LI (a1)

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.