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

Links

PhilArchive



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

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

A jump class of noncappable degrees.S. B. Cooper - 1989 - Journal of Symbolic Logic 54 (2):324-353.
Properly $\Sigma _{2}^{0}$ Enumeration Degrees and the High/Low Hierarchy.Matthew Giorgi, Andrea Sorbi & Yue Yang - 2006 - Journal of Symbolic Logic 71 (4):1125 - 1144.
On measurable limits of compact cardinals.Arthur W. Apter - 1999 - Journal of Symbolic Logic 64 (4):1675-1688.
An example of strongly finite consequence operation with 2ℵ0 standard strengthenings.Wies?aw Dziobiak - 1980 - Studia Logica 39 (4):375 - 379.
A limit on relative genericity in the recursively enumerable sets.Steffen Lempp & Theodore A. Slaman - 1989 - Journal of Symbolic Logic 54 (2):376-395.
A strongly finite logic with infinite degree of maximality.Marek Tokarz - 1976 - Studia Logica 35 (4):447 - 451.
The least measurable can be strongly compact and indestructible.Arthur W. Apter & Moti Gitik - 1998 - Journal of Symbolic Logic 63 (4):1404-1412.
On Degrees of Justification.Gregor Betz - 2012 - Erkenntnis 77 (2):237-272.
Noncappable enumeration degrees below 0'e. [REVIEW]S. Barry Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (4):1347 - 1363.

Analytics

Added to PP
2009-01-28

Downloads
26 (#592,813)

6 months
11 (#226,803)

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