Embedding lattices into the wtt-degrees below 0'
Journal of Symbolic Logic 59 (4):1360-1382 (1994)
| 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,882 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesHiroakira Ono (2003). Closure Operators and Complete Embeddings of Residuated Lattices. Studia Logica 74 (3):427 - 440.
Fairouz Kamareddine & Rob Nederpelt (2004). A Refinement of de Bruijn's Formal Language of Mathematics. Journal of Logic, Language and Information 13 (3):287-340.
Guohua Wu (2002). Isolation and Lattice Embeddings. Journal of Symbolic Logic 67 (3):1055-1064.
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.
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.
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.
Steffen Lempp & Andrea Sorbi (2002). Embedding Finite Lattices Into the Σ02 Enumeration Degrees. Journal of Symbolic Logic 67 (1):69 - 90.
George Barmpalias & Andrew E. M. Lewis (2006). The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees. Notre Dame Journal of Formal Logic 47 (3):361-370.
Michael Stob (1983). Wtt-Degrees and T-Degrees of R.E. Sets. Journal of Symbolic Logic 48 (4):921-930.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
