Totally ω-computably enumerable degrees and bounding critical triples
Journal of Mathematical Logic 7 (02):145-171 (2007)
| 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. Try with proxy. |
| Through your library | Configure |
Similar books and articlesAngsheng Li & Dongping Yang (1998). Bounding Minimal Degrees by Computably Enumerable Degrees. Journal of Symbolic Logic 63 (4):1319-1347.
Shamil Ishmukhametov (2003). On a Problem of Cooper and Epstein. Journal of Symbolic Logic 68 (1):52-64.
Rodney G. Downey, Geoffrey L. Laforte & Richard A. Shore (2003). Decomposition and Infima in the Computably Enumerable Degrees. Journal of Symbolic Logic 68 (2):551-579.
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.
Peter Cholak, Rod Downey & Stephen Walk (2002). Maximal Contiguous Degrees. Journal of Symbolic Logic 67 (1):409-437.
William C. Calhoun (2006). Degrees of Monotone Complexity. Journal of Symbolic Logic 71 (4):1327 - 1341.
Su Gao & Peter Gerdes (2001). Computably Enumerable Equivalence Relations. Studia Logica 67 (1):27-59.
Kevin Wald (2002). On Orbits of Prompt and Low Computably Enumerable Sets. Journal of Symbolic Logic 67 (2):649-678.
Leo Harrington & Robert I. Soare (1996). Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets. Bulletin of Symbolic Logic 2 (2):199-213.
Leo Harrington & Robert I. Soare (1998). Codable Sets and Orbits of Computably Enumerable Sets. Journal of Symbolic Logic 63 (1):1-28.
Noam Greenberg (2005). The Role of True Finiteness in the Admissible Recursively Enumerable Degrees. Bulletin of Symbolic Logic 11 (3):398-410.
Tamara J. Hummel & Carl G. Jockusch Jr (2001). Ramsey's Theorem for Computably Enumerable Colorings. Journal of Symbolic Logic 66 (2):873-880.
André Nies & Andrea Sorbi (2000). Structural Properties and Σ02 Enumeration Degrees. Journal of Symbolic Logic 65 (1):285 - 292.
Theodore A. Slaman & John R. Steel (1989). Complementation in the Turing Degrees. Journal of Symbolic Logic 54 (1):160-176.
R. G. Downey (1989). Recursively Enumerable M- and Tt-Degrees. I: The Quantity of M- Degrees. Journal of Symbolic Logic 54 (2):553-567.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-08-30Total downloads1 ( #277,212 of 556,837 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
