Isolated d.c.e. degrees and $\Sigma_1$ induction
Logic
2025-08-11 v1
Abstract
A Turing degree is d.c.e. if it contains a set that is the difference of two c.e. sets. A d.c.e. degree is isolated by a c.e. degree if all c.e. degrees that are below are also below ; is isolated from above by a c.e. degree if all c.e. degrees that are above are also above . In this paper, we study the inductive strength of both isolated and upper isolated d.c.e. degrees from the point of view of reverse recursion theory. We show that (1) There is an isolated proper d.c.e. degree below ; (2) There is an upper isolated proper d.c.e. degree below .
Cite
@article{arxiv.2508.05951,
title = {Isolated d.c.e. degrees and $\Sigma_1$ induction},
author = {Yiqun Liu and Yong Liu and Cheng Peng},
journal= {arXiv preprint arXiv:2508.05951},
year = {2025}
}