A note on the asymptotic expressiveness of ZF and ZFC. (21st June 2021)

• Record Type: Journal Article
• Authors: Bendkowski, Maciej
• Is Part Of: Journal of logic and computation. Volume 31:Number 7(2021)
• Page Start: 1598
• Page End: 1607
• Publication Date: 2021-06-21
• Subjects: Logic programming -- Periodicals; Logic, Symbolic and mathematical -- Periodicals; Computational complexity -- Periodicals; 005.115
• DOI: 10.1093/logcom/exab038
• Languages: English
• ISSNs: 0955-792X

Abstract

Abstract: 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 .