Embedding the diamond in the σ2 enumeration degree
Journal of Symbolic Logic 56 (1):195 - 212 (1991)
| 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,653 |
| External links |
|
| Through your library | Configure |
Matthew Giorgi, Andrea Sorbi & Yue Yang (2006). Properly $\Sigma _{2}^{0}$ Enumeration Degrees and the High/Low Hierarchy. Journal of Symbolic Logic 71 (4):1125 - 1144.
Richard M. Friedberg (1958). Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration Without Duplication. Journal of Symbolic Logic 23 (3):309-316.
Stanislaw Bereznyuk, Richard Coles & Andrea Sorbi (2000). The Distribution of Properly Σ02 E-Degrees. Journal of Symbolic Logic 65 (1):19 - 32.
Steffen Lempp & Andrea Sorbi (2002). Embedding Finite Lattices Into the {$\Sigma\Sp 0\Sb 2$} Enumeration Degrees. Journal of Symbolic Logic 67 (1):69-90.
Alistair H. Lachlan & Robert I. Soare (1998). Models of Arithmetic and Subuniform Bounds for the Arithmetic Sets. Journal of Symbolic Logic 63 (1):59-72.
S. Barry Cooper & Andrea Sorbi (1996). Noncappable Enumeration Degrees Below 0'e. Journal of Symbolic Logic 61 (4):1347 - 1363.
A. H. Lachlan (1975). Uniform Enumeration Operations. Journal of Symbolic Logic 40 (3):401-409.
André Nies & Andrea Sorbi (2000). Structural Properties and Σ02 Enumeration Degrees. Journal of Symbolic Logic 65 (1):285 - 292.
Steffen Lempp & Andrea Sorbi (2002). Embedding Finite Lattices Into the Σ02 Enumeration Degrees. Journal of Symbolic Logic 67 (1):69 - 90.
Guohua Wu (2002). Isolation and Lattice Embeddings. Journal of Symbolic Logic 67 (3):1055-1064.
Monthly downloads |
Added to index2009-01-28Total downloads4 ( #178,473 of 548,984 )Recent downloads (6 months)1 ( #63,327 of 548,984 )How can I increase my downloads? |

