Please use this identifier to cite or link to this item:
|Title:||Bounding computably enumerable degrees in the Ershov hierarchy||Authors:||Li, A.
|Keywords:||Computably enumerable degrees
|Issue Date:||Aug-2006||Citation:||Li, A., Wu, G., Yang, Y. (2006-08). Bounding computably enumerable degrees in the Ershov hierarchy. Annals of Pure and Applied Logic 141 (1-2) : 79-88. ScholarBank@NUS Repository. https://doi.org/10.1016/j.apal.2005.10.004||Abstract:||Lachlan observed that any nonzero d.c.e. degree bounds a nonzero c.e. degree. In this paper, we study the c.e. predecessors of d.c.e. degrees, and prove that given a nonzero d.c.e. degree a, there is a c.e. degree b below a and a high d.c.e. degree d > b such that b bounds all the c.e. degrees below d. This result gives a unified approach to some seemingly unrelated results. In particular, it has the following two known theorems as corollaries: (1) there is a low c.e. degree isolating a high d.c.e. degree [S. Ishmukhametov, G. Wu, Isolation and the high/low hierarchy, Arch. Math. Logic 41 (2002) 259-266]; (2) there is a high d.c.e. degree bounding no minimal pairs [C.T. Chong, A. Li, Y. Yang, The existence of high nonbounding degrees in the difference hierarchy, Ann. Pure Appl. Logic 138 (2006) 31-51]. © 2005 Elsevier B.V. All rights reserved.||Source Title:||Annals of Pure and Applied Logic||URI:||http://scholarbank.nus.edu.sg/handle/10635/102949||ISSN:||01680072||DOI:||10.1016/j.apal.2005.10.004|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.