Definability in the recursively enumerable degrees

Bulletin of Symbolic Logic 2 (4):392-404 (1996)
Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/421171
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,300
Through your library
References found in this work BETA
A Minimal Pair of Recursively Enumerable Degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
Working Below a Low2 Recursively Enumerably Degree.Richard A. Shore & Theodore A. Slaman - 1990 - Archive for Mathematical Logic 29 (3):201-211.

View all 6 references / Add more references

Citations of this work BETA
On the Definable Ideal Generated by Nonbounding C.E. Degrees.Liang Yu & Yue Yang - 2005 - Journal of Symbolic Logic 70 (1):252 - 270.

Add more citations

Similar books and articles
Infima of Recursively Enumerable Truth Table Degrees.Peter A. Fejer & Richard A. Shore - 1988 - Notre Dame Journal of Formal Logic 29 (3):420-437.
On Recursive Enumerability with Finite Repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
On the Orbits of Hyperhypersimple Sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Complementation in the Turing Degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Added to PP index
2009-01-28

Total downloads
206 ( #20,388 of 2,193,221 )

Recent downloads (6 months)
1 ( #290,278 of 2,193,221 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature