Publisher： Cambridge University Press
E-ISSN： 1943-5886|48|4|921-930
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.48, Iss.4, 1983-12, pp. : 921-930
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
We 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.
Related content
The undecidability of the Π4-theory for the r.e. wtt and Turing degrees
The Journal of Symbolic Logic, Vol. 60, Iss. 4, 1995-12 ,pp. :
Access to resources
Recommend
Splitting properties of r.e. sets and degrees
The Journal of Symbolic Logic, Vol. 51, Iss. 1, 1986-03 ,pp. :
Embedding lattices into the
The Journal of Symbolic Logic, Vol. 59, Iss. 4, 1994-12 ,pp. :
On the
The Journal of Symbolic Logic, Vol. 50, Iss. 3, 1985-09 ,pp. :
The Journal of Symbolic Logic, Vol. 43, Iss. 3, 1978-09 ,pp. :