线性$σ$ -可加性及其应用
Linear $σ$-additivity and some applications
摘要：
我们发现，可数增加工会保持一个大家庭的覆盖性能，这不一定是西格玛添加剂。利用这一点，再加上无限组合方法和简单的强迫理论方法，我们解释了几个现象，解决问题的公正，米勒，Scheepers和Szeptycki [COC 2]，Gruenhage和Szeptycki [FUfin]，Tsaban和Zdomskyy [SFT]，和Tsaban [o-bdd，OPiT]，并构造拓扑群具有非常强的组合性质。
英文摘要：
We show that countable increasing unions preserve a large family of well-studied covering properties, which are not necessarily sigma-additive. Using this, together with infinite-combinatorial methods and simple forcing theoretic methods, we explain several phenomena, settle problems of Just, Miller, Scheepers and Szeptycki [COC2], Gruenhage and Szeptycki [FUfin], Tsaban and Zdomskyy [SFT], and Tsaban [o-bdd, OPiT], and construct topological groups with very strong combinatorial properties.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
