Abstract
AbstractWe use some simple facts about the wtt-degrees of r.e. sets together with a construction to answer some questions concerning the join and meet operators in the r.e. degrees. The construction is that of an r.e. Turing degree a with just one wtt-degree in a such that a is the join of a minimal pair of r.e. degrees. We hope to illustrate the usefulness of studying the stronger reducibility orderings of r.e. sets for providing information about Turing reducibility.
Publisher
Cambridge University Press (CUP)
Reference10 articles.
1. Degrees in Which the Recursive Sets are Uniformly Recursive
2. Lower Bounds for Pairs of Recursively Enumerable Degrees
3. Cohen P.F. [1975], Weak truth table reducibility and the S point wise ordering of 1–1 recursive functions, Doctoral Dissertation, University of Illinois, Champaign-Urbana, Illinois.
4. A recursively enumerable degree which will not split over all lesser ones
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The d.r.e wtt-Degrees are Dense;Computing with Foresight and Industry;2019
2. S. Barry Cooper (1943–2015);Computability;2018-06-07
3. On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets;Computability and Complexity;2016-12-01
4. There Are No Maximal d.c.e. wtt-degrees;Computability and Complexity;2016-12-01
5. Continuity of capping in CbT;Annals of Pure and Applied Logic;2008-08