咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >Non-low2-ness and Computable L... 收藏

Non-low2-ness and Computable Lipschitz Reducibility

Non-low_2-ness and Computable Lipschitz Reducibility

作     者:Yun FAN 

作者机构:School of Mathematics Southeast University Nanjing 210096 P. R. China 

出 版 物:《Acta Mathematica Sinica,English Series》 (数学学报(英文版))

年 卷 期:2017年第33卷第9期

页      面:1184-1192页

核心收录:

学科分类:07[理学] 0701[理学-数学] 070101[理学-基础数学] 

基  金:Supported by NSFC(Grant No.11201065) 

主  题:Non-low2 computable Lipschitz (cl) reducibility complex 

摘      要:In this paper, we prove that if a c.e. Turing degree d is non-low2, then there are two left-c.e, reals β0,β1 in d, such that, if β0 is wtt-reducible to a left-c.e, real a, then β1 is not computable Lipschitz (cl-) reducible to a. As a corollary, d contains a left-c.e, real which is not cl-reducible to any complex (wtt-complete) left-c.e, real.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分