Sacks forcing sometimes needs help to produce a minimal upper bound

DOI10.2307/2274863zbMath0706.03040OpenAlexW2085462264MaRDI QIDQ3486559

Robert S. Lubarsky

Publication date: 1989

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

admissible setSacks forcinghyperdegreesminimal upper bounds

Mathematics Subject Classification ID

Other aspects of forcing and Boolean-valued models (03E40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

IKP and friends

Cites Work

• Sacks forcing does not always produce a minimal upper bound
• Countable admissible ordinals and hyperdegrees
• On a problem of Kleene’s
• Forcing with tagged trees

This page was built for publication: Sacks forcing sometimes needs help to produce a minimal upper bound