A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree

Notre Dame Journal of Formal Logic 51 (4):443-455 (2010)
Abstract
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
Options
 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
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,520
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
2-Minimality, Jump Classes and a Note on Natural Definability.Mingzhong Cai - 2014 - Annals of Pure and Applied Logic 165 (2):724-741.

Add more citations

Similar books and articles
Minimal Complements for Degrees Below 0´.Andrew Lewis - 2004 - Journal of Symbolic Logic 69 (4):937 - 966.
A Minimal Degree Which Collapses Ω.Tim Carlson, Kenneth Kunen & Arnold W. Miller - 1984 - Journal of Symbolic Logic 49 (1):298 - 300.
Minimal Groups in Separably Closed Fields.E. Bouscaren & F. Delon - 2002 - Journal of Symbolic Logic 67 (1):239-259.
Forcing Minimal Degree of Constructibility.Haim Judah & Saharon Shelah - 1991 - Journal of Symbolic Logic 56 (3):769-782.
Bounding Minimal Degrees by Computably Enumerable Degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
Combinatorics on Ideals and Forcing with Trees.Marcia J. Groszek - 1987 - Journal of Symbolic Logic 52 (3):582-593.
A 1-Generic Degree Which Bounds a Minimal Degree.Masahiro Kumabe - 1990 - Journal of Symbolic Logic 55 (2):733-743.
Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.
On a Problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.
A 1-Generic Degree with a Strong Minimal Cover.Masahiro Kumabe - 2000 - Journal of Symbolic Logic 65 (3):1395-1442.
Quasi-o-Minimal Structures.Oleg Belegradek, Ya'Acov Peterzil & Frank Wagner - 2000 - Journal of Symbolic Logic 65 (3):1115-1132.
Added to PP index
2010-09-30

Total downloads
11 ( #409,372 of 2,180,777 )

Recent downloads (6 months)
1 ( #300,627 of 2,180,777 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums