Finite final segments of the d.c.e. Turing degrees
Logic
2024-03-22 v2
Abstract
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.
Cite
@article{arxiv.2403.04254,
title = {Finite final segments of the d.c.e. Turing degrees},
author = {Steffen Lempp and Yiqun Liu and Yong Liu and Keng Meng Ng and Cheng Peng and Guohua Wu},
journal= {arXiv preprint arXiv:2403.04254},
year = {2024}
}