A δ02 set with barely σ02 degree
Journal of Symbolic Logic 64 (4) (1999)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,865 |
| External links |
|
| Through your library | Configure |
Steffen Lempp & Andrea Sorbi (2002). Embedding Finite Lattices Into the Σ02 Enumeration Degrees. Journal of Symbolic Logic 67 (1):69 - 90.
Steffen Lempp (1988). A High Strongly Noncappable Degree. Journal of Symbolic Logic 53 (1):174-187.
E. Hermann (1992). 1-Reducibility Inside an M-Degree with Maximal Set. Journal of Symbolic Logic 57 (3):1046-1056.
Steffen Lempp & Theodore A. Slaman (1989). A Limit on Relative Genericity in the Recursively Enumerable Sets. Journal of Symbolic Logic 54 (2):376-395.
Peter Cholak & Rod Downey (1993). On the Cantor-Bendixon Rank of Recursively Enumerable Sets. Journal of Symbolic Logic 58 (2):629-640.
André Nies & Andrea Sorbi (2000). Structural Properties and Σ02 Enumeration Degrees. Journal of Symbolic Logic 65 (1):285 - 292.
Stanislaw Bereznyuk, Richard Coles & Andrea Sorbi (2000). The Distribution of Properly Σ02 E-Degrees. Journal of Symbolic Logic 65 (1):19 - 32.
Russell Miller (2001). The Δ02-Spectrum of a Linear Order. Journal of Symbolic Logic 66 (2):470 - 486.
Rod Downey, Denis R. Hirschfeldt, Steffen Lempp & Reed Solomon (2001). A Δ02 Set with No Infinite Low Subset in Either It or its Complement. Journal of Symbolic Logic 66 (3):1371 - 1381.
Denis R. Hirschfeldt (2002). Degree Spectra of Relations on Computable Structures in the Presence of Δ02 Isomorphisms. Journal of Symbolic Logic 67 (2):697 - 720.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #277,212 of 556,788 )Recent downloads (6 months)0How can I increase my downloads? |

