Low upper bounds of ideals

Low upper bounds of ideals
复制标题

理想上限较低

DOI:
--
复制
发表时间:
2007
期刊:
Journal of Symbolic Logic (JSL)
影响因子:
--
通讯作者:
T. Slaman
T. Slaman
中科院分区:
--
文献类型:
--
作者:
A. Kucera;T. Slaman

文献摘要

被引文献

相似文献

摘要我们证明了K-平凡集存在一个T-上界,即从算法随机性的角度来看是弱的K-平凡集。这个结果是T-度中理想的更一般刻画的一个特例,T-度有一个低T-上界。
Abstract We show that there is a low T-upper bound for the class of K-trivial sets, namely those which are weak from the point of view of algorithmic randomness. This result is a special case of a more general characterization of ideals in T-degrees for which there is a low T-upper bound.