Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-19T04:24:43.265Z Has data issue: false hasContentIssue false

Wtt-degrees and T-degrees of r.e. sets

Published online by Cambridge University Press:  12 March 2014

Michael Stob*
Affiliation:
Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
*
Calvin College, Grand Rapids, Michigan 49506

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1983

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable