The existential theory of the poset of R.e. Degrees with a predicate for single jump reducibility

Journal of Symbolic Logic 57 (3):1120-1130 (1992)
We show the decidability of the existential theory of the recursively enumerable degrees in the language of Turing reducibility, Turing reducibility of the Turing jumps, and least and greatest element
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275452
 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: 22,062
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
Richard A. Shore (1988). A Non-Inversion Theorem for the Jump Operator. Annals of Pure and Applied Logic 40 (3):277-303.
A. H. Lachlan (1968). Distributive Initial Segments of the Degrees of Unsolvability. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 14 (30):457-472.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

13 ( #284,960 of 1,934,701 )

Recent downloads (6 months)

2 ( #269,464 of 1,934,701 )

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.