Codable sets and orbits of computably enumerable sets

DOI10.2307/2586583zbMath0906.03041MaRDI QIDQ4391418

Robert I. Soare, Leo Harrington

Publication date: 7 February 1999

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

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

zbMATH Keywords

orbit; definability; computability; computably enumerable sets; 2-tardy; automorphic sets.

Mathematics Subject Classification ID

03D25: Recursively (computably) enumerable sets and degrees

Related Items

Implicit measurements of dynamic complexity properties and splittings of speedable sets, The Complexity of Orbits of Computably Enumerable Sets, On \(n\)-tardy sets, Definable properties of the computably enumerable sets, Some orbits for \({\mathcal E}\), 2011 North American Annual Meeting of the Association for Symbolic Logic, On the orbits of computably enumerable sets

Cites Work

• Unnamed Item
• d-simple sets, small sets, and degree classes
• Splitting properties and jump classes
• Conference on computability theory. Proceedings of the conference, Oberwolfach, Germany, January 27--February 3, 1996
• On some games which are relevant to the theory of recursively enumerable sets
• The elementary theory of recursively enumerable sets
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Post's program and incomplete recursively enumerable sets.
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Degrees of recursively enumerable sets which have no maximal supersets
• Recursively enumerable sets of positive integers and their decision problems