English

Bi-Isolated d.c.e. Degrees and $\Sigma_1$ Induction

Logic 2025-12-05 v2

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 if there exists a c.e. degree a<d\mathbf{a}<\mathbf{d} such that every c.e. degree below d\mathbf{d} is also below a\mathbf{a}; d\mathbf{d} is upper isolated if there exists a c.e. degree a>d\mathbf{a}>\mathbf{d} such that every c.e. degree above d\mathbf{d} is also above a\mathbf{a}; d\mathbf{d} is bi-isolated if it is both isolated and upper isolated. In this paper, we prove the existence of bi-isolated d.c.e. degrees in models of IΣ1\mathsf{I}\Sigma_1.

Cite

@article{arxiv.2512.03778,
  title  = {Bi-Isolated d.c.e. Degrees and $\Sigma_1$ Induction},
  author = {Yong Liu and Cheng Peng},
  journal= {arXiv preprint arXiv:2512.03778},
  year   = {2025}
}
R2 v1 2026-07-01T08:07:41.673Z