principal filters definable by parameters in e-bt

	principal filters definable by parameters in e-bt
	Li Angsheng; Li Weilin; Pani Yicheng; Tang Linqing
	2009
会议名称	4th International Conference on Theory and Applications of Models of Computation
会议日期	MAY 22-25,
会议地点	Shanghai, PEOPLES R CHINA
出版地	32 AVENUE OF THE AMERICAS, NEW YORK, NY 10013-2473 USA
出版者	MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
ISSN	0960-1295
部门归属	Li, Angsheng Chinese Acad Sci, State Key Lab Comp Sci, Beijing 100080, Peoples R China. Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
摘要	We show that there exist c.e. bounded Turing degrees a, b such that 0 < a < 0, and that for any c.e. bounded Turing degree x, we have b boolean OR x = 0 if and only if x >= a. The result gives an unexpected definability theorem in the structure of bounded Turing reducibility.
主办者	Fudan Univ, Software Sch, Univ Leeds, Univ Wisconsin
WOS记录号	WOS:000264418400011
引用统计
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/8196
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Li Angsheng,Li Weilin,Pani Yicheng,et al. principal filters definable by parameters in e-bt[C]. 32 AVENUE OF THE AMERICAS, NEW YORK, NY 10013-2473 USA:MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE,2009.