Towards characterizing the $>{\omega }^2$-fickle recursively enumerable Turing degrees

Liling Ko

Given a finite lattice $L$ that can be embedded in the recursively enumerable (r.e.) Turing degrees ${\mathcal{R}}_{\mathrm{T}}$, it is not known how one can characterize the degrees…