How Enumeration Reducibility Yields Extended Harrington Non-Splitting

&
Journal of Symbolic Logic 73 (2):634 - 655 (2008)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1208359064

Links

PhilArchive



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

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

Splitting theorems for speed-up related to order of enumeration.A. M. Dawes - 1982 - Journal of Symbolic Logic 47 (1):1-7.
Noncappable enumeration degrees below 0'e. [REVIEW]S. Barry Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (4):1347 - 1363.
Analytic countably splitting families.Otmar Spinas - 2004 - Journal of Symbolic Logic 69 (1):101-117.
Cupping and definability in the local structure of the enumeration degrees.Hristo Ganchev & Mariya I. Soskova - 2012 - Journal of Symbolic Logic 77 (1):133-158.
Interpreting true arithmetic in the local structure of the enumeration degrees.Hristo Ganchev & Mariya Soskova - 2012 - Journal of Symbolic Logic 77 (4):1184-1194.
Uniform enumeration operations.A. H. Lachlan - 1975 - Journal of Symbolic Logic 40 (3):401-409.
Supervenience and reducibility: An odd couple.Ausonio Marras - 1994 - Philosophical Quarterly 44 (171):215-222.
Three theorems on recursive enumeration. I. decomposition. II. maximal set. III. enumeration without duplication.Richard M. Friedberg - 1958 - Journal of Symbolic Logic 23 (3):309-316.
On the logic of reducibility: Axioms and examples. [REVIEW]Karl-Georg Niebergall - 2000 - Erkenntnis 53 (1-2):27-61.
Dr. Harrington Objects.Milton Harrington & Otto Klineberg - 1938 - Science and Society 2 (4):517 - 520.
On minimal pairs of enumeration degrees.Kevin McEvoy & S. Barry Cooper - 1985 - Journal of Symbolic Logic 50 (4):983-1001.

Analytics

Added to PP
2010-08-24

Downloads
35 (#456,100)

6 months
4 (#787,709)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The jump operator on the ω-enumeration degrees.Hristo Ganchev & Ivan N. Soskov - 2009 - Annals of Pure and Applied Logic 160 (3):289-301.
A non-splitting theorem in the enumeration degrees.Mariya Ivanova Soskova - 2009 - Annals of Pure and Applied Logic 160 (3):400-418.
In memoriam: Barry Cooper 1943–2015.Andrew Lewis-Pye & Andrea Sorbi - 2016 - Bulletin of Symbolic Logic 22 (3):361-365.

Add more citations

References found in this work

Then-rea enumeration degrees are dense.Alistair H. Lachlan & Richard A. Shore - 1992 - Archive for Mathematical Logic 31 (4):277-285.

Add more references