首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Bounding cappable degrees
Authors:Angsheng Li
Institution:(1) Institute of Software, Academia Sinica, P.O. Box 8718, Beijing, China (e-mail: liang@ox.ios.ac.cn) , CN
Abstract:It will be shown that there exist computably enumerable degrees a and b such that a b, and for any computably enumerable degree u, if u a and u is cappable, then u b. Received: 22 April 1997
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号