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 is isolated if there exists a c.e. degree such that every c.e. degree below is also below ; is upper isolated if there exists a c.e. degree such that every c.e. degree above is also above ; 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 .
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}
}