The translation theorem

DOI10.1007/BF01352931zbMath0805.03029OpenAlexW2084309100MaRDI QIDQ1325048

Peter A. Cholak

Publication date: 7 July 1994

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01352931

zbMATH Keywords

maximal setshyperhypersimple setsorbits in the lattice of recursively enumerable setsSoare's Extension TheoremTranslation Theorem

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (4)

The Complexity of Orbits of Computably Enumerable Sets ⋮ Extension theorems, orbits, and automorphisms of the computably enumerable sets ⋮ Definable properties of the computably enumerable sets ⋮ Some orbits for \({\mathcal E}\)

Cites Work

• Friedberg splittings of recursively enumerable sets
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• On the orbits of hyperhypersimple sets
• Automorphisms of the lattice of recursively enumerable sets
• On the Lattice of Recursively Enumerable Sets

This page was built for publication: The translation theorem