On the Degrees of Index Sets. II
From MaRDI portal
Publication:5577087
DOI10.2307/1995015zbMath0185.02201MaRDI QIDQ5577087
Publication date: 1969
Full work available at URL: https://doi.org/10.2307/1995015
Related Items
Computable elements and functions in effectively enumerable topological spaces, Reducibility on families, \(Q _{1}\)-degrees of c.e. sets, Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy, Calculable enumerations and equivalence relations, Upper bounds on ideals in the computably enumerable Turing degrees, Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility, Index sets of degrees of unsolvability, Tabular powers of maximal sets, Index sets and presentations of complexity classes, Classes bounded by incomplete sets, Limitwise monotonic spectra and their generalizations, Some properties of the upper semilattice of computable families of computably enumerable sets, On realization of index sets in \(\Pi_1^0\)-classes, On index sets, Hypersimple sets with retraceable complements, The index sets of m-degrees, \(sQ_1\)-degrees of computably enumerable sets, On Pairs of Recursively Enumerable Degrees, T-Degrees, Jump Classes, and Strong Reducibilities, Strong reducibilities, Recursively enumerable sets and degrees, A Completely Mitotic Nonrecursive R.E. Degree
Cites Work
- Three theorems on the degrees of recursively enumerable sets
- The recursively enumerable degrees are dense
- A maximal set which is not complete
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Enumeration of Recursive Sets
- Degrees of Unsolvability. (AM-55)
- On the Degrees of Index Sets
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
