An arguable inconsistency in ZF

Details An arguable inconsistency in ZF An arguable inconsistency in ZF

2005-02-23

arxiv.org/abs/math/0502503v2

Mathematics

General Mathematics

rev1; typos corrected in formulas; 5 pages; an HTML version is available at http://alixcomsi.com/An_arguable_inconsistency_in_

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An arguable inconsistency in ZF does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An arguable inconsistency in ZF, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An arguable inconsistency in ZF will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-235535