The Δ₃⁰-automorphism method and noninvariant classes of degrees
From MaRDI portal
Publication:5687278
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)
orbitdegreerecursively enumerable setcomputably enumerable setnoneffective automorphismnoninvariant class
Related Items (19)
ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS ⋮ Computably enumerable sets that are automorphic to low sets ⋮ Extending and interpreting Post's programme ⋮ On \(n\)-tardy sets ⋮ Definable relations in Turing degree structures ⋮ The Complexity of Orbits of Computably Enumerable Sets ⋮ Isomorphisms of splits of computably enumerable sets ⋮ The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$ ⋮ Extension theorems, orbits, and automorphisms of the computably enumerable sets ⋮ On the orbits of computably enumerable sets ⋮ Turing computability: structural theory ⋮ Invariance in ℰ* and ℰ_{Π} ⋮ 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 ⋮ Definable Encodings in the Computably Enumerable Sets ⋮ On orbits, of prompt and low computably enumerable sets ⋮ Definable incompleteness and Friedberg splittings
This page was built for publication: The Δ₃⁰-automorphism method and noninvariant classes of degrees
