Title: | principal filters definable by parameters in e-bt |
Author: | Li Angsheng
; Li Weilin
; Pani Yicheng
; Tang Linqing
|
Conference Name: | 4th International Conference on Theory and Applications of Models of Computation
|
Conference Date: | MAY 22-25,
|
Issued Date: | 2009
|
Conference Place: | Shanghai, PEOPLES R CHINA
|
Publisher: | MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
|
Publish Place: | 32 AVENUE OF THE AMERICAS, NEW YORK, NY 10013-2473 USA
|
ISSN: | 0960-1295
|
Department: | 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.
|
Sponsorship: | Fudan Univ, Software Sch, Univ Leeds, Univ Wisconsin
|
English Abstract: | 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. |
Citation statistics: |
|
Content Type: | 会议论文
|
URI: | http://ir.iscas.ac.cn/handle/311060/8196
|
Appears in Collections: | 计算机科学国家重点实验室 _会议论文
|
There are no files associated with this item.
|
Recommended Citation: |
Li Angsheng,Li Weilin,Pani Yicheng,et al. principal filters definable by parameters in e-bt[C]. 见:4th International Conference on Theory and Applications of Models of Computation. Shanghai, PEOPLES R CHINA. MAY 22-25,.
|
|
|