Finite final segments of the d.c.e. Turing degrees
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _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 |