An arguable inconsistency in ZF
General Mathematics
2007-05-23 v2
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.
Cite
@article{arxiv.math/0502503,
title = {An arguable inconsistency in ZF},
author = {Bhupinder Singh Anand},
journal= {arXiv preprint arXiv:math/0502503},
year = {2007}
}
Comments
rev1; typos corrected in formulas; 5 pages; an HTML version is available at http://alixcomsi.com/An_arguable_inconsistency_in_ZF.htm