Asymptotic density and computably enumerable sets

Journal of Mathematical Logic 13 (2):1350005 (2013)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1142/S0219061313500050
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: 39,545
Through your library

References found in this work BETA

The Degrees of Hyperimmune Sets.Webb Miller & D. A. Martin - 1968 - Mathematical Logic Quarterly 14 (7‐12):159-166.
Computational Complexity, Speedable and Levelable Sets.Robert I. Soare - 1977 - Journal of Symbolic Logic 42 (4):545-563.
The Degrees of Bi‐Immune Sets.Carl G. Jockusch - 1969 - Mathematical Logic Quarterly 15 (7‐12):135-140.
Generic Complexity of Undecidable Problems.Alexei G. Myasnikov & Alexander N. Rybalov - 2008 - Journal of Symbolic Logic 73 (2):656 - 673.
Jump Equivalence of the ? 0/2 Hyperhyperimmune Sets.S. B. Cooper - 1972 - Journal of Symbolic Logic 37 (3):598-600.

View all 6 references / Add more references

Citations of this work BETA

The Degrees of Bi-Hyperhyperimmune Sets.Uri Andrews, Peter Gerdes & Joseph S. Miller - 2014 - Annals of Pure and Applied Logic 165 (3):803-811.
The Computational Content of Intrinsic Density.Eric P. Astor - 2018 - Journal of Symbolic Logic 83 (2):817-828.
Nonexistence of Minimal Pairs for Generic Computability.Gregory Igusa - 2013 - Journal of Symbolic Logic 78 (2):511-522.

Add more citations

Similar books and articles

Differences of Computably Enumerable Sets.A. Nies & S. Lempp - 2000 - Mathematical Logic Quarterly 46 (4):555-562.
An Interval of Computably Enumerable Isolating Degrees.Matthew C. Salts - 1999 - Mathematical Logic Quarterly 45 (1):59-72.
Density of the Medvedev Lattice of Π0 1 Classes.Douglas Cenzer & Peter G. Hinman - 2003 - Archive for Mathematical Logic 42 (6):583-600.
The Computably Enumerable Degrees Are Locally Non-Cappable.Matthew B. Giorgi - 2003 - Archive for Mathematical Logic 43 (1):121-139.
A Δ02 Set with Barely Σ02 Degree.Rod Downey, Geoffrey Laforte & Steffen Lempp - 1999 - Journal of Symbolic Logic 64 (4):1700 - 1718.
Computability Results Used in Differential Geometry.Barbara F. Csima & Robert I. Soare - 2006 - Journal of Symbolic Logic 71 (4):1394 - 1410.
On Orbits, of Prompt and Low Computably Enumerable Sets.Kevin Wald - 2002 - Journal of Symbolic Logic 67 (2):649-678.
A $Delta^02$ Set with Barely $Sigma^02$ Degree.Rod Downey, Geoffrey Laforte & Steffen Lempp - 1999 - Journal of Symbolic Logic 64 (4):1700-1718.

Analytics

Added to PP index
2014-01-23

Total views
9 ( #693,774 of 2,325,369 )

Recent downloads (6 months)
4 ( #409,683 of 2,325,369 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature