Extension theorems, orbits, and automorphisms of the computably enumerable sets

DOI10.1090/S0002-9947-07-04025-1zbMath1170.03021arXivmath/0408279MaRDI QIDQ5437614

Peter A. Cholak

Publication date: 21 January 2008

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

Full work available at URL: https://arxiv.org/abs/math/0408279

Mathematics Subject Classification ID

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

Related Items (2)

Isomorphisms of splits of computably enumerable sets ⋮ On the orbits of computably enumerable sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• The translation theorem
• Some orbits for \({\mathcal E}\)
• Atomless \(r\)-maximal sets
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Boolean algebras and orbits of the lattice of r.e sets modulo the finite sets
• On the orbits of hyperhypersimple sets
• Diagonals and semihyperhypersimple sets
• Diagonals and -maximal sets
• Automorphisms of the lattice of recursively enumerable sets
• 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 Friedberg-Muchnik Theorem Re-Examined
• The Δ₃⁰-automorphism method and noninvariant classes of degrees
• On the filter of computably enumerable supersets of an r-maximal set

This page was built for publication: Extension theorems, orbits, and automorphisms of the computably enumerable sets