On the Degrees of Index Sets. II

DOI10.2307/1995015zbMath0185.02201OpenAlexW4243997612MaRDI QIDQ5577087

C. E. M. Yates

Publication date: 1969

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

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (23)

On Pairs of Recursively Enumerable Degrees ⋮ Index sets and presentations of complexity classes ⋮ Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility ⋮ Computable elements and functions in effectively enumerable topological spaces ⋮ Reducibility on families ⋮ Upper bounds on ideals in the computably enumerable Turing degrees ⋮ \(sQ_1\)-degrees of computably enumerable sets ⋮ \(Q _{1}\)-degrees of c.e. sets ⋮ Some properties of the upper semilattice of computable families of computably enumerable sets ⋮ Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy ⋮ Index sets of degrees of unsolvability ⋮ Calculable enumerations and equivalence relations ⋮ Tabular powers of maximal sets ⋮ On realization of index sets in \(\Pi_1^0\)-classes ⋮ Recursively enumerable sets and degrees ⋮ T-Degrees, Jump Classes, and Strong Reducibilities ⋮ On index sets ⋮ A Completely Mitotic Nonrecursive R.E. Degree ⋮ Hypersimple sets with retraceable complements ⋮ The index sets of m-degrees ⋮ Strong reducibilities ⋮ Classes bounded by incomplete sets ⋮ Limitwise monotonic spectra and their generalizations

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

This page was built for publication: On the Degrees of Index Sets. II