## What would be some major consequences of the inconsistency of ZFC?

I was happily surfing the arXiv, when I was jolted by the following paper:

Abstract. 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.

Now this seems to be a very major claim, and I lack the background to be able to judge if the claim is true, or there is some subtle or even obvious defect in the paper's arguments. But picking on this paper itself is not the purpose of my question.

1. The paper, however, got me very curious about how "disastrous" would inconsistency of ZFC really be?

2. A slightly more precise question is: what would be the major consequences of the kind of inconsistency claimed in the abstract cited above?

If you feel that my questions might not admit "clearly right" answers, I will be happy to make this post CW.

-
Depends on the type of inconsistency. There were a bunch of big inconsistencies in the late 1800's and early 1900's and we dealt with them pretty well. We also did well handling inconsistencies related to the use of infinitesimals, but it took a very long time before we fully resolved that issue. Future inconsistencies, if they come, will probably be handled in a similar way... – François G. Dorais Mar 11 2012 at 4:00
The paper is a complete nonsense. For example, there are no proofs there. It is all Wiles' fault. If he did not prove FLT, these people would keep peacefully trying to prove it. Now that FLT is proved, they turn to extremism aiming at destruction of Peano arithmetic. – Mark Sapir Mar 11 2012 at 4:30
The paper provides a train wreck of an argument at page 4 and 5 which links together disparate definitions and statement to give a 1-paragraph proof of the inconsistency of ZFC which doesn't make any sense. – Samuel Reid Mar 11 2012 at 5:57
If you were "jolted" by the paper, then you haven't been browsing arXiv very long. "Contradiction in ZFC" is a frequent topic there, along with "Simple proof of FLT" and so on. – Gerald Edgar Mar 11 2012 at 17:12
@Martin, @Henry: here's a case in point arxiv.org/abs/0809.4144 – Yemon Choi Mar 13 2012 at 2:24

I'm confident that ZFC is consistent, but one can imagine an inconsistency. Like François said, it would probably be handled pretty well. I'd divide the possibilities into four cases:

1. A technicality, like separation vs. comprehension in ZFC. This would be an important thing to get right, but it would have little impact on the theorems mathematicians prove. (For example, Frege's system was inconsistent, but his mistake didn't propagate.)

2. A topic requiring serious clarification, like infinitesimals in the 1600's. The intution was right, but it took some genuine work to turn this intuition into actual theorems with rigorous proofs.

3. A topic that fundamentally cannot be clarified, where some part of mathematics just turns out to be defective. For example, imagine if cardinals beyond $\aleph_0$ were inherently self-contradictory, and no clarification could save them. This would require huge modifications to set theory.

4. It could turn out that we have no idea what any of mathematics really means. For example, if Peano Arithmetic were inconsistent, then it would call into question the whole axiomatic approach to mathematics. It would be tantamount to saying that the natural numbers as we understand them do not exist. (Some parts of the axiomatic approach could still survive, but I don't think it would be wise to trust anything if we couldn't even get the consistency of PA right.)

My feeling is that 1 is very unlikely, 2 would be among the biggest shocks in the history of mathematics, 3 is difficult to imagine, and 4 is so extreme that if I read a proof of the inconsistency of PA, I'd be more likely to decide that I had gone crazy than that PA was actually inconsistent.

-
P.S. Regarding the cited abstract, it sounds like the claimed results are probably somewhere in category 2 or 3. However, like Mark pointed out, the paper is incoherent, so there is no evidence of danger to ZFC. – Henry Cohn Mar 11 2012 at 6:03
Dear Henry, Thanks a lot for your erudite answer. – S. Sra Mar 11 2012 at 17:23
In case 4, one could imagine that the natural numbers are OK but that the use of arbitrarily deep nesting of quantifiers (in instances of the induction schema) is the source of the contradiction. Losing quantification would be (at least) as disastrous as losing the natural numbers, but I think it's a different disaster. (And I agree that my going crazy is far more likely than an actual inconsistency in PA.) – Andreas Blass Mar 13 2012 at 14:14
This MO question contains further discussion of the inconsistency of PA: mathoverflow.net/questions/66121/… – Timothy Chow Mar 13 2012 at 15:11

To misquote Scott Aaronson,[1] every paper ever published in Annals of Mathematics would have to be withdrawn ("the theorems are still true, but so are their negations").

-
The paper says the opposite of that. What point are you trying to make by making a statement that you admit is a misquote? – Ben Crowell Dec 9 at 4:17