Definable encodings in the computably enumerable sets
Bulletin of Symbolic Logic 6 (2):185-196 (2000)
| 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,664 |
| External links |
|
| Through your library | Configure |
Barbara F. Csima & Robert I. Soare (2006). Computability Results Used in Differential Geometry. Journal of Symbolic Logic 71 (4):1394 - 1410.
Su Gao & Peter Gerdes (2001). Computably Enumerable Equivalence Relations. Studia Logica 67 (1):27-59.
E. Herrmann (1984). Definable Structures in the Lattice of Recursively Enumerable Sets. Journal of Symbolic Logic 49 (4):1190-1197.
Michael A. Jahn (1999). Implicit Measurements of Dynamic Complexity Properties and Splittings of Speedable Sets. Journal of Symbolic Logic 64 (3):1037-1064.
Wolfgang Maass (1984). On the Orbits of Hyperhypersimple Sets. Journal of Symbolic Logic 49 (1):51-62.
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.
Peter A. Cholak & Leo A. Harrington (2003). Isomorphisms of Splits of Computably Enumerable Sets. Journal of Symbolic Logic 68 (3):1044-1064.
Peter A. Cholak, Rodney Downey & Leo A. Harrington (2008). The Complexity of Orbits of Computably Enumerable Sets. The Bulletin of Symbolic Logic 14 (1):69 - 87.
Leo Harrington & Robert I. Soare (1998). Codable Sets and Orbits of Computably Enumerable Sets. Journal of Symbolic Logic 63 (1):1-28.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,602 of 549,013 )Recent downloads (6 months)0How can I increase my downloads? |

