arXiv · math/0502503
An arguable inconsistency in ZF
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Bhupinder Singh Anand. 2005-02-26. An arguable inconsistency in ZF. https://arxiv.org/abs/math/0502503
Cite the original work for its findings. Save a collection to share your selection of sources.