CROWDING OF FUNCTIONS, PARA-SATURATION OF IDEALS, AND TOPOLOGICAL APPLICATIONS
CROWDING OF FUNCTIONS, PARA-SATURATION OF IDEALS, AND TOPOLOGICAL APPLICATIONS
复制标题
函数拥挤、理想的准饱和以及拓扑应用
DOI：
--
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
P. Nyikos
中科院分区：
文献类型：
--
作者：
P. Nyikos
我们学习一对公理，说@2函数从！1对！在较强的意义上是拥挤的，并讨论了较弱的公理F的一些拓扑应用。这些公理被分成三个不同的公理模式：一个是由Donder提出的关于函数拥挤的旧公理模式; Rado;和一个para-saturation的理想对，这是介绍这里。在第三模式的公理有不同的地位：最平凡的是真的ZFC，而其他人是假的，还有一些是独立的ZFC，但其中一些是equiconsistent与大基数公理和其他人不是。
We study a pair of axioms that say @2 functions from !1 to ! are crowded in a rather strong sense and discuss a number of topological applications of the weaker one, Axiom F. The axioms are fitted into three dierent axiom schema: an old one on crowding of functions due to Donder; a modi- fication of a still older one due to P. Erd˝os and R. Rado; and one on para-saturation of pairs of ideals, which is introduced here. The axioms in the third schema have varying status: the most trivial ones are true in ZFC, while others are false, and still others are independent of ZFC—but some of these are equiconsistent with large cardinal axioms and others are not.