bounding computably enumerable degrees in the ershov hierarchy

ISCAS OpenIR > 互联网软件技术实验室

	bounding computably enumerable degrees in the ershov hierarchy
	Li AS; Wu GH; Yang Y
	2006
发表期刊	ANNALS OF PURE AND APPLIED LOGIC
ISSN	0168-0072
卷号	141 期号:1-2 页码:79-88
收录类别	SCI
关键词	Computably Enumerable Degrees Highness Ershov Hierarchy
部门归属	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.
学科领域	Mathematics ; Applied ; Mathematics
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/11452
专题	互联网软件技术实验室
推荐引用方式 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.