The Δ₃⁰-automorphism method and noninvariant classes of degrees

DOI10.1090/S0894-0347-96-00181-6zbMath0862.03025MaRDI QIDQ5687278

Robert I. Soare, Leo Harrington

Publication date: 11 December 1996

Published in: Journal of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

orbit; degree; recursively enumerable set; computably enumerable set; noneffective automorphism; noninvariant class

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

Related Items

Definable Encodings in the Computably Enumerable Sets, Isomorphisms of splits of computably enumerable sets, ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS, The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$, The Complexity of Orbits of Computably Enumerable Sets, Extension theorems, orbits, and automorphisms of the computably enumerable sets, On \(n\)-tardy sets, Definable relations in Turing degree structures, Extending and interpreting Post's programme, The dense simple sets are orbit complete with respect to the simple sets, Definable properties of the computably enumerable sets, Some orbits for \({\mathcal E}\), Orbits of computably enumerable sets: Low sets can avoid an upper cone, Turing computability: structural theory, Computably enumerable sets that are automorphic to low sets, On the orbits of computably enumerable sets, On orbits, of prompt and low computably enumerable sets, Definable incompleteness and Friedberg splittings, Invariance in ℰ* and ℰ_{Π}