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

关于计数公理弱变式的强度

On the strength of a weak variant of the Axiom of Counting

Zachiri McKenzie

摘要:

本文用$\mathrm{NFU}^{-\mathrm{AC}}$来表示Ronald Jensen对Quine的“新基础”集合论($\mathrm{NF}$)的修正,该修正用类型级配对函数强化,但没有选择选择公理。公理$\mathrm{AxCount}_\geq$是计数公理的变体,它断言没有一个有限集小于它自己的单例集。本文证明了$\mathrm{NFU}^{-\mathrm{AC}}+\mathrm{AxCount}_\geq$证明了简单类型论与无穷大($\mathrm{TSTI}$)的相容性.这个结果意味着$\mathrm{NF}+\mathrm{AxCount}_\geq$证明了$\mathrm{TSTI}$的一致性,而$\mathrm{NFU}^{-\mathrm{AC}}+\mathrm{AxCount}_\geq$证明了$\mathrm{NFU}^{-\mathrm{AC}}$的一致性。

英文摘要:

In this paper $\mathrm{NFU}^{-\mathrm{AC}}$ is used to denote Ronald Jensen's modification of Quine's `New Foundations' Set Theory ($\mathrm{NF}$) fortified with a type-level pairing function but without the Axiom of Choice. The axiom $\mathrm{AxCount}_\geq$ is the variant of the Axiom of Counting which asserts that no finite set is smaller than its own set of singletons. This paper shows that $\mathrm{NFU}^{-\mathrm{AC}}+\mathrm{AxCount}_\geq$ proves the consistency of the Simple Theory of Types with Infinity ($\mathrm{TSTI}$). This result implies that $\mathrm{NF}+\mathrm{AxCount}_\geq$ proves that consistency of $\mathrm{TSTI}$, and that $\mathrm{NFU}^{-\mathrm{AC}}+\mathrm{AxCount}_\geq$ proves the consistency of $\mathrm{NFU}^{-\mathrm{AC}}$.

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

↑