Institutional Repository
| bounding computably enumerable degrees in the ershov hierarchy | |
| Li AS; Wu GH; Yang Y | |
| 2006 | |
| Source | ANNALS OF PURE AND APPLIED LOGIC
 |
| ISSN | 0168-0072 |
| Volume | 141Issue:1-2Pages:79-88 |
| Indexed Type | SCI |
| Keyword | Computably Enumerable Degrees Highness Ershov Hierarchy |
| Department | Nanyang Technol Univ, Sch Math & Phys Sci, Div Math Sci, Singapore 639798, Singapore. Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China. Natl Univ Singapore, Dept Math, Singapore 119260, Singapore. |
| Subject | Mathematics ; Applied ; Mathematics |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/11452 |
| Collection | 互联网软件技术实验室 |
| Recommended Citation GB/T 7714 | Li AS,Wu GH,Yang Y. bounding computably enumerable degrees in the ershov hierarchy[J]. ANNALS OF PURE AND APPLIED LOGIC,2006,141(1-2):79-88. |
| APA | Li AS,Wu GH,&Yang Y.(2006).bounding computably enumerable degrees in the ershov hierarchy.ANNALS OF PURE AND APPLIED LOGIC,141(1-2),79-88. |
| MLA | Li AS,et al."bounding computably enumerable degrees in the ershov hierarchy".ANNALS OF PURE AND APPLIED LOGIC 141.1-2(2006):79-88. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| bounding computably （219KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment