Embedding finite lattices into the {$\Sigma\sp 0\sb 2$} enumeration degrees
Journal of Symbolic Logic 67 (1):69-90 (2002)
| 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,875 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesSteffen Lempp & Andrea Sorbi (2002). Embedding Finite Lattices Into the Σ02 Enumeration Degrees. Journal of Symbolic Logic 67 (1):69 - 90.
Thomas F. Kent (2006). The Π₃-Theory of the $\Sigma _{2}^{0}$ -Enumeration Degrees Is Undecidable. Journal of Symbolic Logic 71 (4):1284 - 1302.
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.
André Nies & Andrea Sorbi (2000). Structural Properties and Σ02 Enumeration Degrees. Journal of Symbolic Logic 65 (1):285 - 292.
William C. Calhoun & Manuel Lerman (2001). Embedding Finite Lattices Into the Ideals of Computably Enumerable Turing Degrees. Journal of Symbolic Logic 66 (4):1791-1802.
S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang (2005). Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees. Journal of Symbolic Logic 70 (3):741 - 766.
Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp & Manuel Lerman (1996). Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices. Journal of Symbolic Logic 61 (3):880-905.
Steffen Lempp, Theodore A. Slaman & Andrea Sorbi (2005). On Extensions of Embeddings Into the Enumeration Degrees of the -Sets. Journal of Mathematical Logic 5 (02):247-298.
S. Barry Cooper & Andrea Sorbi (1996). Noncappable Enumeration Degrees Below 0'e. Journal of Symbolic Logic 61 (4):1347 - 1363.
Hernando Gaitan (1996). Representation of Finite Demi-P-Lattices by Means of Posets. Studia Logica 56 (1-2):97 - 110.
Rod Downey & Christine Haught (1994). Embedding Lattices Into the Wtt-Degrees Below 0'. Journal of Symbolic Logic 59 (4):1360-1382.
William C. Calhoun & Theodore A. Slaman (1996). The Π02 Enumeration Degrees Are Not Dense. Journal of Symbolic Logic 61 (4):1364 - 1379.
Thomas F. Kent & Andrea Sorbi (2007). Bounding Nonsplitting Enumeration Degrees. Journal of Symbolic Logic 72 (4):1405-1417.
Zofia Adamowicz (1977). On Finite Lattices of Degrees of Constructibility. Journal of Symbolic Logic 42 (3):349-371.
Dong Ping Yang (1984). On the Embedding of |Alpha-Recursive Presentable Lattices Into the Α-Recursive Degrees Below 0'. Journal of Symbolic Logic 49 (2):488 - 502.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-08-24Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
