On the Degrees of Index Sets. II
From MaRDI portal
Publication:5577087
Cites work
- A maximal set which is not complete
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Degrees of Unsolvability. (AM-55)
- Enumeration of Recursive Sets
- On the Degrees of Index Sets
- The recursively enumerable degrees are dense
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Three theorems on the degrees of recursively enumerable sets
Cited in
(25)- Tabular powers of maximal sets
- Classes bounded by incomplete sets
- On \(bQ_1\)-degrees of c.e. sets
- Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy
- Computable elements and functions in effectively enumerable topological spaces
- \(sQ_1\)-degrees of computably enumerable sets
- Limitwise monotonic spectra and their generalizations
- Hypersimple sets with retraceable complements
- Calculable enumerations and equivalence relations
- Reducibility on families
- Some properties of the upper semilattice of computable families of computably enumerable sets
- \(Q _{1}\)-degrees of c.e. sets
- Strong reducibilities
- Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility
- T-Degrees, Jump Classes, and Strong Reducibilities
- The index sets of m-degrees
- On Pairs of Recursively Enumerable Degrees
- On the c.e. degrees realizable in \(\Pi^0_1\) classes
- Upper bounds on ideals in the computably enumerable Turing degrees
- Index sets and presentations of complexity classes
- Recursively enumerable sets and degrees
- A Completely Mitotic Nonrecursive R.E. Degree
- On index sets
- On realization of index sets in \(\Pi_1^0\)-classes
- Index sets of degrees of unsolvability
This page was built for publication: On the Degrees of Index Sets. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5577087)
