Highness, locally noncappability and nonboundings

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

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

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: An International Quarterly 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
2013-12-12

Downloads
14 (#971,788)

6 months
2 (#1,229,212)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Minimal pairs and high recursively enumerable degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
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 - 2004 - Archive for Mathematical Logic 43 (1):121-139.

View all 6 references / Add more references