Annals of Pure and Applied Logic ( IF 0.8 ) Pub Date : 2020-05-13 , DOI: 10.1016/j.apal.2020.102827 Natasha Dobrinen , Dan Hathaway , Karel Prikry
We investigate forcing properties of perfect tree forcings defined by Prikry to answer a question of Solovay in the late 1960's regarding first failures of distributivity. Given a strictly increasing sequence of regular cardinals , Prikry defined the forcing of all perfect subtrees of , and proved that for , assuming the necessary cardinal arithmetic, the Boolean completion of is -distributive for all but -distributivity fails for all , implying failure of the -d.l. These hitherto unpublished results are included, setting the stage for the following recent results. satisfies a Sacks-type property, implying that is -distributive. The -d.l. and the -d.l. fail in . completely embeds into . Also, collapses to . We further prove that if κ is a limit of countably many measurable cardinals, then adds a minimal degree of constructibility for new ω-sequences. Some of these results generalize to cardinals κ with uncountable cofinality.
中文翻译:
单数主教的完美树强迫
我们调查了由Prikry定义的完美树强迫的强迫属性,以回答Solovay在1960年代后期有关首次分配失败的问题。鉴于常规红衣主教严格增加了顺序,Prikry定义了强制 的所有完美子树 ,并证明 ,假设必要的基本算术,则布尔完成 的 是 -为所有人分配 但 -所有人的分配失败 ,表示失败 -dl包括了这些迄今尚未发布的结果,为以下最近的结果奠定了基础。 满足Sacks类型的属性,这意味着 是 -分布。的-dl和 -dl失败 。 完全嵌入 。也, 崩溃 至 。我们进一步证明,如果κ是许多可测量基数的极限,则为新的ω序列增加了最小程度的可构造性。其中一些结果普遍适用于具有不可数最终确定性的红衣主教κ。