Minimal Covers and Hyperdegrees

DOI10.2307/1997369zbMath0316.02049OpenAlexW4236731166MaRDI QIDQ4075452

Stephen G. Simpson

Publication date: 1975

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

Mathematics Subject Classification ID

Descriptive set theory (03E15) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65) Hierarchies of computability and definability (03D55)

Related Items (6)

Countable admissible ordinals and hyperdegrees ⋮ Classes of Polish spaces under effective Borel isomorphism ⋮ On the Reals Which Cannot Be Random ⋮ BASIS THEOREMS FOR -SETS ⋮ Cofinal maximal chains in the Turing degrees ⋮ On the First Order Theory of the Arithmetical Degrees

Cites Work

• Unnamed Item
• Unnamed Item
• On degrees of recursive unsolvability
• Countable admissible ordinals and hyperdegrees
• A basis theorem for \(\sum^ 1_ 3\) sets of reals
• Degrees of members of \(\Pi_ 1^ 0\) classes
• Recursive well-orderings
• Prioric games and minimal degrees below $0^{(1)}$
• Minimal degrees and the jump operator
• The Theory of Countable Analytical Sets
• A minimal degree not realizing least possible jump
• Borel sets and hyperdegrees
• A Basis Result for ∑ 0 3 Sets of Reals with an Application to Minimal Covers
• An application of Σ₄⁰ determinacy to the degrees of unsolvability
• Metarecursive sets
• A Nonconstructible Δ 1 3 Set of Integers
• The axiom of determinateness and reduction principles in the analytical hierarchy
• The Forcing Method and the Upper Semilattice of Hyperdegrees
• Bar Induction and Π₁¹-CA
• Recursive Pseudo-Well-Orderings
• Degrees of unsolvability of constructible sets of integers
• A minimal hyperdegree
• Minimal Covers and Arithmetical Sets
• On initial segments of hyperdegrees
• Measure-Theoretic Uniformity in Recursion Theory and Set Theory
• Measurable cardinals and analytic games
• A minimal pair of Π₁⁰ classes
• The next admissible set
• Determinateness in the low protective hierarchy
• Degrees of unsolvability complementary between recursively enumerable degrees, Part 1
• The α-finite injury method
• ∏ 0 1 Classes and Degrees of Theories
• ZF ⊦ Σ₄⁰ determinateness

This page was built for publication: Minimal Covers and Hyperdegrees