On the orbits of computably enumerable sets

DOI10.1090/S0894-0347-08-00604-8zbMath1214.03028arXiv0705.0125OpenAlexW2014802624MaRDI QIDQ3058264

Peter A. Cholak, Rodney G. Downey

Publication date: 19 November 2010

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

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

zbMATH Keywords

treeautomorphismBoolean algebraorbitisomorphismScott rankcomputably enumerable setsimple set

Mathematics Subject Classification ID

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

Related Items (4)

2011 North American Annual Meeting of the Association for Symbolic Logic ⋮ There is no classification of the decidably presentable structures ⋮ The isomorphism problem for torsion-free abelian groups is analytic complete ⋮ -MAXIMAL SETS

Cites Work

• Unnamed Item
• Unnamed Item
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
• Computable structures and the hyperarithmetical hierarchy
• Some orbits for \({\mathcal E}\)
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• On the orbits of hyperhypersimple sets
• Post's program and incomplete recursively enumerable sets.
• Codable sets and orbits of computably enumerable sets
• Isomorphisms of splits of computably enumerable sets
• On the Lattice of Recursively Enumerable Sets
• ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
• Π₁¹ relations and paths through
• Extension theorems, orbits, and automorphisms of the computably enumerable sets
• The Δ₃⁰-automorphism method and noninvariant classes of degrees

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