Partial degrees and the density problem. Part 2: The enumeration degrees of the ∑2 sets are dense
Journal of Symbolic Logic 49 (2):503 - 513 (1984)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,711 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesPaul Shafer (2010). Characterizing the Join-Irreducible Medvedev Degrees. Notre Dame Journal of Formal Logic 52 (1):21-38.
Michael Stob (1983). Wtt-Degrees and T-Degrees of R.E. Sets. Journal of Symbolic Logic 48 (4):921-930.
Marcia J. Groszek, Michael E. Mytilinaios & Theodore A. Slaman (1996). The Sacks Density Theorem and Σ2-Bounding. Journal of Symbolic Logic 61 (2):450 - 467.
S. B. Cooper (1982). Partial Degrees and the Density Problem. Journal of Symbolic Logic 47 (4):854-859.
Thomas F. Kent (2006). The Π₃-Theory of the $\Sigma _{2}^{0}$ -Enumeration Degrees Is Undecidable. Journal of Symbolic Logic 71 (4):1284 - 1302.
Su Gao (1994). The Degrees of Conditional Problems. Journal of Symbolic Logic 59 (1):166-181.
Jeanleah Mohrherr (1983). Kleene Index Sets and Functional M-Degrees. Journal of Symbolic Logic 48 (3):829-840.
André Nies & Andrea Sorbi (2000). Structural Properties and Σ02 Enumeration Degrees. Journal of Symbolic Logic 65 (1):285 - 292.
Zhang Qinglong (1992). The Density of the Meet-Inaccessible R.E. Degrees. Journal of Symbolic Logic 57 (2):585-596.
William C. Calhoun & Theodore A. Slaman (1996). The Π02 Enumeration Degrees Are Not Dense. Journal of Symbolic Logic 61 (4):1364 - 1379.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #275,109 of 551,055 )Recent downloads (6 months)1 ( #63,341 of 551,055 )How can I increase my downloads? |
My notes
Discussion
