Sacks forcing sometimes needs help to produce a minimal upper bound
From MaRDI portal
Publication:3486559
DOI10.2307/2274863zbMath0706.03040MaRDI QIDQ3486559
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
03E40: Other aspects of forcing and Boolean-valued models
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
Cites Work