Codable sets and orbits of computably enumerable sets
From MaRDI portal
Recommendations
Cites work
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Conference on computability theory. Proceedings of the conference, Oberwolfach, Germany, January 27--February 3, 1996
- d-simple sets, small sets, and degree classes
- Degrees of recursively enumerable sets which have no maximal supersets
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- On some games which are relevant to the theory of recursively enumerable sets
- Post's program and incomplete recursively enumerable sets.
- Recursively enumerable sets of positive integers and their decision problems
- Splitting properties and jump classes
- The elementary theory of recursively enumerable sets
Cited in
(11)- Definable properties of the computably enumerable sets
- Some orbits for \({\mathcal E}\)
- \(\mathcal{D}\)-maximal sets
- 2011 North American Annual Meeting of the Association for Symbolic Logic, University of California at Berkeley, Berkeley, CA, USA, March 24--27, 2011
- On the orbits of computably enumerable sets
- On \(n\)-tardy sets
- scientific article; zbMATH DE number 841085 (Why is no real title available?)
- Implicit measurements of dynamic complexity properties and splittings of speedable sets
- The Complexity of Orbits of Computably Enumerable Sets
- Extension theorems, orbits, and automorphisms of the computably enumerable sets
- Some recent research directions in the computably enumerable sets
This page was built for publication: Codable sets and orbits of computably enumerable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4391418)
