Enregistré dans:
Détails bibliographiques
Auteurs principaux: Lempp, Steffen, Liu, Yiqun, Liu, Yong, Ng, Keng Meng, Peng, Cheng, Wu, Guohua
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:https://arxiv.org/abs/2403.04254
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866910377034383360
author Lempp, Steffen
Liu, Yiqun
Liu, Yong
Ng, Keng Meng
Peng, Cheng
Wu, Guohua
author_facet Lempp, Steffen
Liu, Yiqun
Liu, Yong
Ng, Keng Meng
Peng, Cheng
Wu, Guohua
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2403_04254
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Finite final segments of the d.c.e. Turing degrees
Lempp, Steffen
Liu, Yiqun
Liu, Yong
Ng, Keng Meng
Peng, Cheng
Wu, Guohua
Logic
03D28
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.
title Finite final segments of the d.c.e. Turing degrees
topic Logic
03D28
url https://arxiv.org/abs/2403.04254