An arguable inconsistency in ZF
Bhupinder Singh Anand
Abstract
Classical theory proves that every primitive recursive function is strongly representable in PA; that formal Peano Arithmetic, PA, and formal primitive recursive arithmetic, PRA, can both be interpreted in Zermelo-Fraenkel Set Theory, ZF; and that if ZF is consistent, then PA+PRA is consistent. We show that PA+PRA is inconsistent; it follows that ZF, too, is inconsistent.
Create a lesson
Related papers
On the Rank Condition for Perfect Cuboids
Valery Asiryan
A Local Proof of Langlands's First Main Lemma for Local Epsilon Factors over Nonarchimedean Local Fields
Fukuhiro Ueda
The first type of power mean bounds for the Gaussian hypergeometric function
Zhen-Hang, Yang, Jing-Feng Tian
On a new class of q-fractional integral operators involving multivariate q-Mittag-Leffler functions
Min-Jie Luo, Qing-Hui Peng, Ravinder Krishna Raina
Partition-theoretic density formulas: radial Tauberian theory and non-radial instability
Mohammad F. Marashdeh
Octonionic Kittaneh Numerical Radius Inequalities
K. Mahesh Krishna