...
首页> 外文期刊>Commentationes mathematicae Universitatis Carolinae >Todorcevic orderings as examples of ccc forcings without adding random reals
【24h】

Todorcevic orderings as examples of ccc forcings without adding random reals

机译:Todorcevic排序作为ccc强制的示例,不添加随机实数

获取原文
           

摘要

In [{it Two examples of Borel partially ordered sets with the countable chain condition/}, Proc. Amer. Math. Soc. {f 112} (1991), no.~4, 1125--1128], Todorcevic introduced a ccc forcing which is Borel definable in a separable metric space. In [{it On Todorcevic orderings/}, Fund. Math., to appear], Balcar, Paz'ak and Th"ummel applied it to more general topological spaces and called such forcings {it Todorcevic orderings/}. There they analyze Todorcevic orderings quite deeply. A significant remark is that Th"ummel solved the problem of Horn and Tarski by use of Todorcevic ordering [{it The problem of Horn and Tarski/}, Proc. Amer. Math. Soc. {f 142} (2014), no.~6, 1997--2000]. This paper supplements the analysis of Todorcevic orderings due to Balcar, Paz'ak and Th"ummel in [{it On Todorcevic orderings/}, Fund.~ Math., to appear]. More precisely, it is proved that Todorcevic orderings add no random reals whenever they have the countable chain condition.
机译:在[{ it,带有可数链条条件的Borel部分有序集的两个示例中,Proc。阿米尔。数学。 Soc。 { bf 112}(1991),〜4,1125--1128],Todorcevic引入了ccc强制,它是Borel在可分离的度量空间中可定义的。在[{ it Todorcevic orders //}中,输入Fund。数学,[出现],Balcar,Paz'ak和Th “ ummel将其应用于更一般的拓扑空间,并称这种强迫为{ it Todorcevic orders /}。在那里他们对Todorcevic的排序进行了相当深入的分析。 Thummel通过使用Todorcevic命令解决了Horn和Tarski的问题[Prof. Horc and Tarski /}的问题。阿米尔。数学。 Soc。 { bf 142}(2014),~~ 6,1997--2000]。本文补充了[[ it On Todorcevic orders /},Fund。〜Math。,出现]中Balcar,Paz ak和Th “ ummel引起的Todorcevic排序的分析。更确切地说,证明了Todorcevic排序在具有可数链条条件时不会添加随机实数。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号