当前位置: X-MOL 学术J. Log. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A note on the asymptotic expressiveness of ZF and ZFC
Journal of Logic and Computation ( IF 0.7 ) Pub Date : 2021-05-20 , DOI: 10.1093/logcom/exab038
Maciej Bendkowski 1
Affiliation  

We investigate the asymptotic densities of theorems provable in Zermelo–Fraenkel set theory zf and its extension zfc including the axiom of choice. Assuming a canonical De Bruijn representation of formulae, we construct asymptotically large sets of sentences unprovable within zf, yet provable in zfc. Furthermore, we link the asymptotic density of zfc theorems with the provable consistency of zfc itself. Consequently, if zfc is consistent, it is not possible to refute the existence of the asymptotic density of zfc theorems within zfc. Both these results address a recent question by Zaionc regarding the asymptotic equivalence of zf and zfc.

中文翻译:

关于 ZF 和 ZFC 的渐近表达性的注释

我们研究了在 Zermelo-Fraenkel 集合论 zf 及其扩展 zfc 中可证明的定理的渐近密度,包括选择公理。假设公式的规范 De Bruijn 表示,我们构造渐近大的句子集,在 zf 中不可证明,但在 zfc 中可证明。此外,我们将 zfc 定理的渐近密度与 zfc 本身可证明的一致性联系起来。因此,如果 zfc 是一致的,则无法反驳 zfc 内 zfc 定理的渐近密度的存在。这两个结果都解决了 Zaionc 最近提出的关于 zf 和 zfc 的渐近等价的问题。
更新日期:2021-05-20
down
wechat
bug