Noncappable Enumeration Degrees Below $0'_e$

&
Journal of Symbolic Logic 61 (3):1347-1363 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,991

External links

  • This entry has no external links. Add one.
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

Noncappable enumeration degrees below 0'e. [REVIEW]S. Barry Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (4):1347 - 1363.
The Distribution of Properly $Sigma^0_2$ e-Degrees.Stanislaw Bereznyuk, Richard Coles & Andrea Sorbi - 2000 - Journal of Symbolic Logic 65 (1):19-32.
The Π20 enumeration degrees are not dense.William C. Calhoun & Theodore A. Slaman - 1996 - Journal of Symbolic Logic 61 (4):1364-1379.
On Cupping and Ahmad Pairs.Iskander Sh Kalimullin, Steffen Lempp, N. G. Keng Meng & Mars M. Yamaleev - forthcoming - Journal of Symbolic Logic:1-12.
A note on the enumeration degrees of 1-generic sets.Liliana Badillo, Caterina Bianchini, Hristo Ganchev, Thomas F. Kent & Andrea Sorbi - 2016 - Archive for Mathematical Logic 55 (3):405-414.
The $\Pi^0_2$ Enumeration Degrees are Not Dense.William Calhoun & Theodore Slaman - 1996 - Journal of Symbolic Logic 61 (3):1364-1379.
Initial segments of the enumeration degrees.Hristo Ganchev & Andrea Sorbi - 2016 - Journal of Symbolic Logic 81 (1):316-325.
The limitations of cupping in the local structure of the enumeration degrees.Mariya I. Soskova - 2010 - Archive for Mathematical Logic 49 (2):169-193.
A jump class of noncappable degrees.S. B. Cooper - 1989 - Journal of Symbolic Logic 54 (2):324-353.
The Π₃-Theory of the $\Sigma _{2}^{0}$ -Enumeration Degrees Is Undecidable.Thomas F. Kent - 2006 - Journal of Symbolic Logic 71 (4):1284 - 1302.

Analytics

Added to PP
2017-02-21

Downloads
5 (#1,560,957)

6 months
1 (#1,515,053)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.

Add more citations

References found in this work

No references found.

Add more references