A high strongly noncappable degree

Journal of Symbolic Logic 53 (1):174-187 (1988)
  Copy   BIBTEX

Abstract

An r.e. degree a ≠ 0, 0' is called strongly noncappable if it has no inf with any incomparable r.e. degree. We show the existence of a high strongly noncappable degree

Categories

Keywords

Reprint years

DOI

10.2307/2274436

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,553

External links

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

Through your library

My notes

Similar books and articles

Infima in the Recursively Enumerable Weak Truth Table Degrees.Rich Blaylock, Rod Downey & Steffen Lempp - 1997 - Notre Dame Journal of Formal Logic 38 (3):406-418.
Noncappable enumeration degrees below 0'e. [REVIEW]S. Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (4):1347 - 1363.
Highness, locally noncappability and nonboundings.Frank Stephan & Guohua Wu - 2013 - Annals of Pure and Applied Logic 164 (5):511-522.
An almost-universal cupping degree.Jiang Liu & Guohua Wu - 2011 - Journal of Symbolic Logic 76 (4):1137-1152.
On the Cantor-bendixon rank of recursively enumerable sets.Peter Cholak & Rod Downey - 1993 - Journal of Symbolic Logic 58 (2):629-640.
Initial segments of the enumeration degrees.Hristo Ganchev & Andrea Sorbi - 2016 - Journal of Symbolic Logic 81 (1):316-325.
Noncappable Enumeration Degrees Below $0'_e$.S. Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (3):1347-1363.
On the r.e. predecessors of d.r.e. degrees.Shamil Ishmukhametov - 1999 - Archive for Mathematical Logic 38 (6):373-386.
Weak Density and Nondensity among Transfinite Levels of the Ershov Hierarchy.Yong Liu & Cheng Peng - 2020 - Notre Dame Journal of Formal Logic 61 (4):521-536.
On very high degrees.Keng Meng Ng - 2008 - Journal of Symbolic Logic 73 (1):309-342.

Analytics

Added to PP
2009-01-28

Downloads
49 (#453,573)

6 months
14 (#243,699)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Bounding cappable degrees.Angsheng Li - 2000 - Archive for Mathematical Logic 39 (5):311-352.

Add more citations

References found in this work

No references found.

Add more references