Graduate studies at Western
Journal of Symbolic Logic 67 (2):649-678 (2002)
|Abstract||This paper concerns automorphisms of the computably enumerable sets. We prove two results relating semilow sets and prompt degrees via automorphisms, one of which is complementary to a recent result of Downey and Harrington. We also show that the property of effective simplicity is not invariant under automorphism, and that in fact every promptly simple set is automorphic to an effectively simple set. A major technique used in these proofs is a modification of the Harrington-Soare version of the method of Harrington-Soare and Cholak for constructing Δ 0 3 automorphisms; this modification takes advantage of a recent result of Soare on the extension of "restricted" automorphisms to full automorphisms|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Peter A. Cholak & Leo A. Harrington (2000). Definable Encodings in the Computably Enumerable Sets. Bulletin of Symbolic Logic 6 (2):185-196.
Barbara F. Csima & Robert I. Soare (2006). Computability Results Used in Differential Geometry. Journal of Symbolic Logic 71 (4):1394 - 1410.
Peter Cholak (1995). Automorphisms of the Lattice of Recursively Enumerable Sets. American Mathematical Society.
Wolfgang Maass (1984). On the Orbits of Hyperhypersimple Sets. Journal of Symbolic Logic 49 (1):51-62.
Peter A. Cholak, Rodney Downey & Leo A. Harrington (2008). The Complexity of Orbits of Computably Enumerable Sets. Bulletin of Symbolic Logic 14 (1):69 - 87.
Wolfgang Maass (1982). Recursively Enumerable Generic Sets. Journal of Symbolic Logic 47 (4):809-823.
Peter A. Cholak & Leo A. Harrington (2003). Isomorphisms of Splits of Computably Enumerable Sets. Journal of Symbolic Logic 68 (3):1044-1064.
Russell Miller (2002). Definable Incompleteness and Friedberg Splittings. Journal of Symbolic Logic 67 (2):679-696.
Leo Harrington & Robert I. Soare (1998). Codable Sets and Orbits of Computably Enumerable Sets. Journal of Symbolic Logic 63 (1):1-28.
Leo Harrington & Robert I. Soare (1996). Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets. Bulletin of Symbolic Logic 2 (2):199-213.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #292,878 of 740,510 )
Recent downloads (6 months)0
How can I increase my downloads?