Countable admissible ordinals and hyperdegrees

DOI10.1016/0001-8708(76)90187-0zbMath0439.03027OpenAlexW1986191839MaRDI QIDQ1142207

Gerald E. Sacks

Publication date: 1976

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0001-8708(76)90187-0

zbMATH Keywords

hyperdegreescountable admissible ordinalsforcing with perfect trees

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (41)

Extended ultrapowers and the Vopěnka-Hrbáček theorem without choice ⋮ Admissibility spectra through \(\omega _ 1\) ⋮ Scott ranks of models of a theory ⋮ Minimalα-hyperdegrees ⋮ Inadmissible forcing ⋮ Applications of iterated perfect set forcing ⋮ Playing with admissibility spectra ⋮ Admissibility spectra and minimality ⋮ The countable admissible ordinal equivalence relation ⋮ Minimal coding ⋮ A Π¹₁-uniformization principle for reals ⋮ Sacks forcing sometimes needs help to produce a minimal upper bound ⋮ Capacitability for Co-Analytic Sets ⋮ Sacks forcing does not always produce a minimal upper bound ⋮ Avoiding Medvedev reductions inside a linear order ⋮ The Π21$\Pi ^1_2$ consequences of a theory ⋮ Higher Kurtz randomness ⋮ Minimality in the Δ⅓-degrees ⋮ Minimal collapsing extensions of models of ZFC ⋮ Degree-theoretic bounds on the morley rank ⋮ Polish Group Actions and the Vaught Conjecture ⋮ Universal co-analytic sets ⋮ Bounding lemmata for non-deterministic halting times of transfinite Turing machines ⋮ Bounds on the strength of ordinal definable determinacy in small admissible sets ⋮ More Lowenheim-Skolem results for admissible sets ⋮ Analytic sets having incomparable kleene degrees ⋮ Some recent developments in higher recursion theory ⋮ On the ultrafilter of closed, unbounded sets ⋮ CLASSES OF STRUCTURES WITH NO INTERMEDIATE ISOMORPHISM PROBLEMS ⋮ Strong reducibilities and set theory ⋮ Possible-worlds semantics for modal notions conceived as predicates ⋮ A theorem about Σ¹₁ equivalence relations ⋮ Minimal upper bounds for sequences of -degrees ⋮ HC of an admissible set ⋮ Minimal Covers and Hyperdegrees ⋮ Minimal model of \(\aleph ^ L_ 1\) is countable and definable reals ⋮ Model theory for \(L_{\infty \omega _ 1}\) ⋮ The Theory of Countable Analytical Sets ⋮ Degree-invariant, analytic equivalence relations without perfectly many classes ⋮ Reflection and forcing in E-recursion theory ⋮ Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On degrees of recursive unsolvability
• The upper semi-lattice of degrees of recursive unsolvability
• Hyperarithmetical quantifiers
• Minimal Covers and Hyperdegrees
• Some applications of the notions of forcing and generic sets
• Constructive transfinite number classes
• Degrees of unsolvability of constructible sets of integers
• A minimal hyperdegree
• Infinitary logic and admissible sets
• Omitting types: application to recursion theory
• On Suborderings of Degrees of Recursive Unsolvability
• Recursive Functionals and Quantifiers of Finite Types II

This page was built for publication: Countable admissible ordinals and hyperdegrees