Institutional Repository
| Bounding computably enumerable degrees in the Ershov hierarchy | |
| Li AS; Wu GH; Yang Ye; Wu; GH (通讯作者); Nanyang Technol Univ; Sch Math & Phys Sci; Div Math Sci; Singapore 639798; Singapore | |
| 2006 | |
| Source | Annals of Pure and Applied Logic
 |
| Volume | 141Issue:40180Pages:79-88 |
| Indexed Type | sci ; sciencedirect |
| Keyword | Computably Enumerable Degrees Highness Ershov Hierarchy Dre Degrees |
| Department | 基础软件国家工程研究中心 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/3810 |
| Collection | 基础软件国家工程研究中心 |
| Corresponding Author | Wu; GH (通讯作者); Nanyang Technol Univ; Sch Math & Phys Sci; Div Math Sci; Singapore 639798; Singapore |
| Recommended Citation GB/T 7714 | Li AS,Wu GH,Yang Ye,et al. Bounding computably enumerable degrees in the Ershov hierarchy[J]. Annals of Pure and Applied Logic,2006,141(40180):79-88. |
| APA | Li AS.,Wu GH.,Yang Ye.,Wu.,GH .,...&Singapore.(2006).Bounding computably enumerable degrees in the Ershov hierarchy.Annals of Pure and Applied Logic,141(40180),79-88. |
| MLA | Li AS,et al."Bounding computably enumerable degrees in the Ershov hierarchy".Annals of Pure and Applied Logic 141.40180(2006):79-88. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 1.pdf（219KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment