English

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 d\mathbf{d} is isolated by a c.e. degree a<d\mathbf{a}<\mathbf{d} if all c.e. degrees that are below d\mathbf{d} are also below a\mathbf{a}; d\mathbf{d} is isolated from above by a c.e. degree a>d\mathbf{a}>\mathbf{d} if all c.e. degrees that are above d\mathbf{d} are also above a\mathbf{a}. 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) P+BΣ1+ExpIΣ1P^{-} + B\Sigma_1 + \text{Exp} \vdash I\Sigma_1 \leftrightarrow There is an isolated proper d.c.e. degree below 0\mathbf{0}'; (2) P+BΣ1+ExpIΣ1P^{-} + B\Sigma_1 + \text{Exp} \vdash I\Sigma_1 \leftrightarrow There is an upper isolated proper d.c.e. degree below 0\mathbf{0}'.

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}
}
R2 v1 2026-07-01T04:40:11.619Z