Kavli Affiliate: Cheng Peng
| First 5 Authors: Steffen Lempp, Yiqun Liu, Yong Liu, Keng Meng Ng, Cheng Peng
| Summary:
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.
| Search Query: ArXiv Query: search_query=au:”Cheng Peng”&id_list=&start=0&max_results=3