There's an ongoing discussion on math sites about Vladimir Voevodsky's Fall 2010 lecture expressing doubts that math is consistent, i.e. doubts that it is not possible to deduce formally correct proofs of false statements starting from standard axioms.
Isn't this just the same as saying at least one of the standard axioms are false?
It sort of depends on what you mean by false. Syntactically, inconsistency would mean that I can derive anything, including proofs of impossibility of completeness, proofs of completeness etc.
Taking the lecture literally, I take it that Voevodsky considers it wholly possible that PA will cough up mutually incompatible statements at some point and we will no longer have a good reason to suppose that it is inconsistent.
Another possibility is that he wanted to to point out that this is not strictly speaking ruled out so you should pay attention to his work... (read more)