Showing math.LOShow all
3 papers · 1 filter
math.LO2025
Bi-Isolated d.c.e. Degrees and Induction
Yong Liu, Cheng Peng
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 $\mathbf{a}<\mathbf{d…
math.LO2025
Isolated d.c.e. degrees and induction
Yiqun Liu, Yong Liu, Cheng Peng
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…
math.LO2022
On the Nonexistence of a Strong Minimal Pair
Mingzhong Cai, Yiqun Liu, Yong Liu +2
Two nonzero recursively enumerable (r.e.) degrees and form a strong minimal pair if and $\mathbf{b}\vee \mathbf{…