A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree

Notre Dame Journal of Formal Logic 51 (4):443-455 (2010)
We develop a new method for constructing hyperimmune minimal degrees and construct an ANR degree which is a minimal cover of a minimal degree
Keywords minimal degrees   n-minimal degrees   array nonrecursive   tree systems
Categories (categorize this paper)
DOI 10.1215/00294527-2010-028
 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: 24,479
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

Add more citations

Similar books and articles
Andrew Lewis (2004). Minimal Complements for Degrees Below 0´. Journal of Symbolic Logic 69 (4):937 - 966.
William C. Calhoun (2006). Degrees of Monotone Complexity. Journal of Symbolic Logic 71 (4):1327 - 1341.

Monthly downloads

Added to index


Total downloads

11 ( #381,788 of 1,925,766 )

Recent downloads (6 months)

1 ( #418,414 of 1,925,766 )

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.