Infimum Properties Differ in the Weak Truth-table Degrees and the Turing Degrees期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

按检索

Infimum Properties Differ in the Weak Truth-table Degrees and the Turing Degrees

Authors:	Liang Yu De Cheng Ding

Institution:	(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 等数据库收录！