中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 互联网软件技术实验室  > 期刊论文
学科主题: Mathematics ; Applied; Mathematics
题名:
bounding computably enumerable degrees in the ershov hierarchy
作者: Li AS ; Wu GH ; Yang Y
关键词: computably enumerable degrees ; highness ; Ershov hierarchy
刊名: ANNALS OF PURE AND APPLIED LOGIC
发表日期: 2006
卷: 141, 期:1-2, 页:79-88
收录类别: SCI
部门归属: 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.
内容类型: 期刊论文
URI标识: http://ir.iscas.ac.cn/handle/311060/11450
Appears in Collections:互联网软件技术实验室 _期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
bounding computably enumerable degrees in the ershov hierarchy.pdf(219KB)----限制开放-- 联系获取全文

Recommended Citation:
Li AS,Wu GH,Yang Y. bounding computably enumerable degrees in the ershov hierarchy[J]. ANNALS OF PURE AND APPLIED LOGIC,2006-01-01,141(1-2):79-88.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Li AS]'s Articles
[Wu GH]'s Articles
[Yang Y]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Li AS]‘s Articles
[Wu GH]‘s Articles
[Yang Y]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院软件研究所 - Feedback
Powered by CSpace