On the definability of the double jump in the computably enumerable sets

Journal of Mathematical Logic 2 (02):261-296 (2002)
Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1142/S0219061302000151
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 34,959
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 12 (1):295-310.
Degrees of Classes of RE Sets.J. R. Shoenfield - 1976 - Journal of Symbolic Logic 41 (3):695-696.
Recursion, Metarecursion, and Inclusion.James C. Owings Jr - 1967 - Journal of Symbolic Logic 32 (2):173-179.

Add more references

Citations of this work BETA

A Hierarchy of Computably Enumerable Degrees.Rod Downey & Noam Greenberg - 2018 - Bulletin of Symbolic Logic 24 (1):53-89.
Degree Invariance in the [Image] Classes.Rebecca Weber - 2011 - Journal of Symbolic Logic 76 (4):1184 - 1210.

Add more citations

Similar books and articles

On Orbits of Prompt and Low Computably Enumerable Sets.Kevin Wald - 2002 - Journal of Symbolic Logic 67 (2):649-678.
Computability Results Used in Differential Geometry.Barbara F. Csima & Robert I. Soare - 2006 - Journal of Symbolic Logic 71 (4):1394 - 1410.
Recursively Enumerable Generic Sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Generalized Cohesiveness.Tamara Hummel & Carl G. Jockusch Jr - 1999 - Journal of Symbolic Logic 64 (2):489-516.
On the Orbits of Hyperhypersimple Sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Bounding Minimal Degrees by Computably Enumerable Degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.

Analytics

Added to PP index
2012-09-02

Total downloads
15 ( #379,659 of 2,273,667 )

Recent downloads (6 months)
1 ( #375,363 of 2,273,667 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature