Annals of Pure and Applied Logic 164 (5):511-522 (2013)

Abstract
In this paper, we improve a result of Seetapun and prove that above any nonzero, incomplete recursively enumerable degree a, there is a high2 r.e. degree c>ac>a witnessing that a is locally noncappable . Theorem 1.1 provides a scheme of obtaining high2 nonboundings , as all known high2 nonboundings, such as high2 degrees bounding no minimal pairs, high2 plus-cuppings, etc
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/j.apal.2012.11.008
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 54,385
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

Highness and Bounding Minimal Pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
Minimal Pairs and High Recursively Enumerable Degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
Degrees Which Do Not Bound Minimal Degrees.Manuel Lerman - 1986 - Annals of Pure and Applied Logic 30 (3):249-276.
The Computably Enumerable Degrees Are Locally Non-Cappable.Matthew B. Giorgi - 2003 - Archive for Mathematical Logic 43 (1):121-139.

View all 6 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Is Eating Locally a Moral Obligation?Gregory R. Peterson - 2013 - Journal of Agricultural and Environmental Ethics 26 (2):421-437.
Open Subspaces of Locally Compact Metric Spaces.Mark Mandelkern - 1993 - Mathematical Logic Quarterly 39 (1):213-216.
Endangered Scholars Worldwide.Matt Congdon - 2011 - Social Research 78 (1):5-14.
A Remark on Locally Pure Measures.Siu-ah Ng - 1993 - Journal of Symbolic Logic 58 (4):1165-1170.
Topological Complexity of Locally Finite Ω-Languages.Olivier Finkel - 2008 - Archive for Mathematical Logic 47 (6):625-651.
Measure Theory Aspects of Locally Countable Orderings.Liang Yu - 2006 - Journal of Symbolic Logic 71 (3):958 - 968.
One Theorem of Zil′Ber's on Strongly Minimal Sets.Steven Buechler - 1985 - Journal of Symbolic Logic 50 (4):1054-1061.
Quantifier-Eliminable Locally Finite Graphs.Shawn Hedman & Wai Yan Pong - 2011 - Mathematical Logic Quarterly 57 (2):180-185.

Analytics

Added to PP index
2013-12-12

Total views
11 ( #780,079 of 2,367,994 )

Recent downloads (6 months)
1 ( #556,092 of 2,367,994 )

How can I increase my downloads?

Downloads

My notes