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


Infimum Properties Differ in the WeakTruth-table Degrees and the Turing Degrees
Authors:Liang Yu  De Cheng Ding
Affiliation:(1) Department of Mathematics, Nanjing University, Nanjing, 210093, P. R. China
Abstract:
Abstract We prove that there are non-recursive r.e. sets A and C with A < T C such that for every set $$
F leqslant _{T} A,{kern 1pt} {kern 1pt} C cap F equiv _{W} emptyset 
$$ . Both authors are supported by “863” and the National Science Foundation of China
Keywords:Minimal pair  Weak truth table degree  Turing degree  Recursively enumerable set
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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