The ∆ 0 3-automorphism method and noninvariant classes of degrees

The ∆ 0 3-automorphism method and noninvariant classes of degrees (1996)

Cached

Download Links

[www.ams.org]

by Leo Harrington , Robert , I. Soare

Venue:	J. Amer. Math. Soc
Citations:	12 - 1 self

BibTeX

@ARTICLE{Harrington96the∆,
    author = {Leo Harrington and Robert and I. Soare},
    title = {The ∆ 0 3-automorphism method and noninvariant classes of degrees},
    journal = {J. Amer. Math. Soc},
    year = {1996},
    volume = {9},
    pages = {617--666}
}

Bookmark

OpenURL

Abstract

AsetAof nonnegative integers is computably enumerable (c.e.), also called recursively enumerable (r.e.), if there is a computable method to list its elements. Let E denote the structure of the computably enumerable sets under inclusion, E =({We}e∈ω,⊆). Most previously known automorphisms Φ of the structure E of

Citations

106	Recursively enumerable sets of positive integers and their decision problems - Post - 1944
52	Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets - Soare - 1987
43	Classes of recursively enumerable sets and degrees of unsolvability - Martin - 1966
30	Automorphisms of the lattice of recursively enumerable sets: Orbits - Downey, Stob - 1992
27	A recursively enumerable degree which will not split over all lesser ones - Lachlan
20	Post’s program and incomplete recursively enumerable sets - Harrington, Soare - 1991
15	On some games which are relevant to the theory of recursively enumerable sets - Lachlan - 1970
15	Recursively enumerable generic sets - Maass - 1982
14	Degrees of recursively enumerable sets which have no maximal supersets - Lachlan
13	Splitting properties and jump classes - Maass, Shore, et al. - 1981
12	d-simple sets, small sets, and degree classes - Lerman, Soare - 1980
11	Codable sets and orbits of computably enumerable sets - Harrington, Soare - 1998
11	On the orbit of hyperhypersimple sets - Maass - 1984
9	Characterization of recursively enumerable sets with supersets effectively isomorphic to all recursively enumerable sets - Maass - 1983
8	Soare, Games in recursion theory and continuity properties of capping degrees - Harrington, I
7	Variations on promptly simple sets - Maass - 1985
6	Soare, Automorphisms of the lattice of recursively enumerable sets - I - 1982
5	Soare, Dynamic properties of computably enumerable sets, In: Computability, Enumerability, Unsolvability: Directions in Recursion Theory - Harrington, I - 1996
3	Cappable recursively enumerable degrees and Post's program - Ambos-Spies, Nies - 1992
3	Soare, Martin's Invariance Conjecture and low sets, in preparation - Harrington, I
3	Degrees of classes of RE sets - Shoenfield - 1976
2	The Lattice of Sets Recursively Enumerable in an Oracle - Hammond - 1990
2	Soare, Algebraic properties of low 2 computably enumerable sets, in preparation - Harrington, Lachlan, et al.
2	Soare, Definable properties of the computably enumerable sets, in preparation - Harrington, I - 1998
1	Automorphisms of the recursively enumerable sets, Part I: Maximal sets - Soare - 1974