The Complexity of Orbits of Computably Enumerable Sets

DOI10.2178/BSL/1208358844MaRDI QIDQ5387296zbMATH OpenOpenAlexFDO

Authors Peter A. Cholak, Rodney G. Downey, Leo Harrington

Publication date 8 May 2008

Published in The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/bsl/1208358844

Mathematics Subject Classification ID

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

Recommendations

• On the orbits of computably enumerable sets
• There is no fat orbit
• Extension theorems, orbits, and automorphisms of the computably enumerable sets
• Codable sets and orbits of computably enumerable sets
• The computably enumerable sets: recent results and future directions

Cites work

• A criterion for completeness of degrees of unsolvability
• Automorphisms of the lattice of recursively enumerable sets
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Codable sets and orbits of computably enumerable sets
• Computable structures and the hyperarithmetical hierarchy
• d-simple sets, small sets, and degree classes
• INVARIANCE AND NONINVARIANCE IN THE LATTICE OF \Pi₁⁰ CLASSES
• Invariance in ℰ* and ℰ_{Π}
• Isomorphisms of splits of computably enumerable sets
• Jumps of Hemimaximal Sets
• ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
• On the orbits of hyperhypersimple sets
• Post's program and incomplete recursively enumerable sets.
• Recursively enumerable sets of positive integers and their decision problems
• Some orbits for \({\mathcal E}\)
• The intervals of the lattice of recursively enumerable sets determined by major subsets
• The translation theorem
• The upper semi-lattice of degrees of recursive unsolvability
• The Δ₃⁰-automorphism method and noninvariant classes of degrees
• There is no fat orbit
• Π₁¹ relations and paths through

Cited in

(11)

• The dense simple sets are orbit complete with respect to the simple sets
• Some orbits for \({\mathcal E}\)
• \(\mathcal{D}\)-maximal sets
• On the orbits of computably enumerable sets
• scientific article; zbMATH DE number 1191231 (Why is no real title available?)
• Codable sets and orbits of computably enumerable sets
• Orbit complexity by computable structures
• Extension theorems, orbits, and automorphisms of the computably enumerable sets
• The computably enumerable sets: recent results and future directions
• Model-theoretic complexity of automatic structures
• Some recent research directions in the computably enumerable sets

This page was built for publication: The Complexity of Orbits of Computably Enumerable Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387296)