An arguable inconsistency in ZF

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
rev1; typos corrected in formulas; 5 pages; an HTML version is available at http://alixcomsi.com/An_arguable_inconsistency_in_ZF.htm

Keywords

General Mathematics, 03B10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/74303

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0502503
 http://arxiv.org/abs/math/0502503

Collections

arXiv