Finite final segments of the d.c.e. Turing degrees
Steffen Lempp, Yiqun Liu, Yong Liu, Keng Meng Ng, Cheng Peng, Guohua Wu · arXiv (Cornell University) · 2024
We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a corollary, we are able to infer the undecidability of the EAE-theory of the d.c.e. degrees in the language of partial ordering.