The Complexity of Orbits of Computably Enumerable Sets

DOI10.2178/BSL/1208358844zbMATH Open1142.03022OpenAlexW2761813262MaRDI QIDQ5387296FDOQ5387296

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• \(\mathcal{D}\)-maximal sets
• Title not available (Why is that?)
• Model-theoretic complexity of automatic structures
• Some recent research directions in the computably enumerable sets
• Orbit complexity by computable structures
• On the orbits of computably enumerable sets
• The computably enumerable sets: recent results and future directions
• Extension theorems, orbits, and automorphisms of the computably enumerable sets
• Some orbits for \({\mathcal E}\)

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)