On the orbits of hyperhypersimple sets

DOI10.2307/2274090zbMath0579.03027OpenAlexW2130173926MaRDI QIDQ3701409

Wolfgang Maass

Publication date: 1984

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274090

zbMATH Keywords

isomorphism

Mathematics Subject Classification ID

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

Related Items (7)

The Complexity of Orbits of Computably Enumerable Sets ⋮ Isomorphisms of splits of computably enumerable sets ⋮ Extension theorems, orbits, and automorphisms of the computably enumerable sets ⋮ Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets ⋮ On the orbits of computably enumerable sets ⋮ Definable properties of the computably enumerable sets ⋮ The translation theorem

Cites Work

• \(r\)-maximal major subsets
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Recursively enumerable sets and degrees
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability

This page was built for publication: On the orbits of hyperhypersimple sets