Inconsistency of the Zermelo-Fraenkel set theory with the axiom of choice and its effects on the computational complexity

Details Inconsistency of the Zermelo-Fraenkel set theory with the axiom of choice and its effects on the computational complexity Inconsistency of the Zermelo-Fraenkel set theory with the axiom of choice and its effects on the computational complexity

2012-03-02

arxiv.org/abs/1203.0494v1

Computer Science

Logic in Computer Science

9 pages

Scientific paper

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a stronger system or methods that are outside the scope of the system. The paper shows that the cardinalities of infinite sets are uncontrollable and contradictory. The paper then states that Peano arithmetic, or first-order arithmetic, is inconsistent if all of the axioms and axiom schema assumed in the ZFC system are taken as being true, showing that ZFC is inconsistent. The paper then exposes some consequences that are in the scope of the computational complexity theory.

Affiliated with

Also associated with

No associations

Rating

Inconsistency of the Zermelo-Fraenkel set theory with the axiom of choice and its effects on the computational complexity 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 Inconsistency of the Zermelo-Fraenkel set theory with the axiom of choice and its effects on the computational complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inconsistency of the Zermelo-Fraenkel set theory with the axiom of choice and its effects on the computational complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-166910