ISCAS OpenIR  > 基础软件与系统重点实验室
principal filters definable by parameters in e-bt
Li Angsheng; Li Weilin; Pani Yicheng; Tang Linqing
2009
Conference Name4th International Conference on Theory and Applications of Models of Computation
Conference DateMAY 22-25,
Conference PlaceShanghai, PEOPLES R CHINA
Publish Place32 AVENUE OF THE AMERICAS, NEW YORK, NY 10013-2473 USA
PublisherMATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
ISSN0960-1295
DepartmentLi, Angsheng Chinese Acad Sci, State Key Lab Comp Sci, Beijing 100080, Peoples R China. Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
English AbstractWe 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.
SponsorshipFudan Univ, Software Sch, Univ Leeds, Univ Wisconsin
WOS IDWOS:000264418400011
Citation statistics
Content Type会议论文
URIhttp://ir.iscas.ac.cn/handle/311060/8196
Collection基础软件与系统重点实验室
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Li Angsheng]'s Articles
[Li Weilin]'s Articles
[Pani Yicheng]'s Articles
Baidu academic
Similar articles in Baidu academic
[Li Angsheng]'s Articles
[Li Weilin]'s Articles
[Pani Yicheng]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Li Angsheng]'s Articles
[Li Weilin]'s Articles
[Pani Yicheng]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

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