An arguable inconsistency in ZF

Simple item page
dc.creatorAnand, Bhupinder Singh
dc.date2005-02-23
dc.date2005-02-26
dc.date.accessioned2026-07-07T05:17:26Z
dc.date.available2026-07-07T05:17:26Z
dc.descriptionClassical 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.
dc.descriptionrev1; typos corrected in formulas; 5 pages; an HTML version is available at http://alixcomsi.com/An_arguable_inconsistency_in_ZF.htm
dc.identifierhttps://arxiv.org/abs/math/0502503
dc.identifierhttp://arxiv.org/abs/math/0502503
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74303
dc.subjectGeneral Mathematics
dc.subject03B10
dc.titleAn arguable inconsistency in ZF
dc.typetext

Files

Collections

arXiv