arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.2239math.GNmath.LO
收藏

线性加细数与选择理论

The linear refinement number and selection theory

Michał Machura, Saharon Shelah, Boaz Tsaban

摘要:

\emph{linear refinement number} $\mathfrak{lr}$是$[ω]^ω$中的中心族的最小基数,使得$([ω]^ω,\subseteq^*)$中没有线性有序集细化这个族。\emph{linear excluded middle number} $\mathfrak{lx}$是$\mathfrak{lr}$的变体。我们表明,这些数字估计的一些选择性覆盖性能的临界基数。我们比较这些数字的经典组合基数特征的连续。我们证明了在所有连续统至多为$\aleph_2$的模型中$\mathfrak{lr}=\mathfrak{lx}=\mathfrak{fd}$是唯一的,并且证明了$\mathfrak{lr}$的共尾性是不可数的.使用强迫的方法,我们表明,$\mathfrak{lr}$和$\mathfrak{lx}$是不可证明的等于$\mathfrak{d}$,并排除了这些数字的几个潜在的界限。我们的研究结果解决了一些开放的问题。

英文摘要:

The \emph{linear refinement number} $\mathfrak{lr}$ is the minimal cardinality of a centered family in $[ω]^ω$ such that no linearly ordered set in $([ω]^ω,\subseteq^*)$ refines this family. The \emph{linear excluded middle number} $\mathfrak{lx}$ is a variation of $\mathfrak{lr}$. We show that these numbers estimate the critical cardinalities of a number of selective covering properties. We compare these numbers to the classic combinatorial cardinal characteristics of the continuum. We prove that $\mathfrak{lr}=\mathfrak{lx}=\mathfrak{fd}$ in all models where the continuum is at most $\aleph_2$, and that the cofinality of $\mathfrak{lr}$ is uncountable. Using the method of forcing, we show that $\mathfrak{lr}$ and $\mathfrak{lx}$ are not provably equal to $\mathfrak{d}$, and rule out several potential bounds on these numbers. Our results solve a number of open problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑