Wtt-degrees and t-degrees of R.e. Sets

Journal of Symbolic Logic 48 (4):921-930 (1983)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273658
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,667
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

View all 6 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

11 ( #219,143 of 1,726,580 )

Recent downloads (6 months)

3 ( #231,303 of 1,726,580 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.