On the Degrees of Index Sets

DOI10.2307/1994481zbMath0143.25401OpenAlexW4241081383MaRDI QIDQ5519130

C. E. M. Yates

Publication date: 1966

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

zbMATH Keywords

mathematical logic

Related Items

On the Turing degrees of minimal index sets, The ∀∃-theory of ℛ(≤,∨,∧) is undecidable, Index sets in the arithmetical hierarchy, Index sets and presentations of complexity classes, A non-inversion theorem for the jump operator, Index sets related to prompt simplicity, On the Lattice of Recursively Enumerable Sets, On the Degrees of Index Sets. II, Simple structures with complex symmetry, Index sets of degrees of unsolvability, Calculable enumerations and equivalence relations, Application of precomplete enumerations to tabular-type degrees and index sets, Completeness in the arithmetical hierarchy and fixed points, On realization of index sets in \(\Pi_1^0\)-classes, Recursively enumerable sets and degrees, The index sets of m-degrees, Strong reducibilities, Degree structures of conjunctive reducibility

Cites Work

• Unnamed Item
• Computing degrees of unsolvability
• The recursively enumerable degrees are dense
• A maximal set which is not complete
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Retraceable Sets
• Some Theorems on Classes of Recursively Enumerable Sets
• Theory of Formal Systems. (AM-47)
• Recursively Enumerable Sets and Retracing Functions
• Degrees of Unsolvability. (AM-55)
• A minimal pair of recursively enumerable degrees
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• A Theorem on Hypersimple Sets
• Recursively enumerable sets of positive integers and their decision problems
• Creative sets