Hacker News new | past | comments | ask | show | jobs | submit login

My understanding is that if proof by contradiction is allowed in A, Φ ∨ ¬Φ is a true sentence in A, so if you try to include the sentence "A is inconsistent" in A, it follows that A ⊢ Φ and A ⊢ ¬Φ, therefore in A Φ ∧ ¬Φ is true, but this contradicts Φ ∨ ¬Φ, therefore A is consistent. In other words, it is impossible to show the inconsistency of any system that includes the law of excluded middle.

This is really trivial in the end. Inconsistency is "Φ ∧ ¬Φ", law of excluded middle is "Φ ∨ ¬Φ", so in the assumption of law of excluded middle is hidden the assumption of consistency. That's what he means by

The above theorem means that the assumption of consistency is deeply embedded in the structure of classical mathematics

Edit: I agree with you in the end, the proof is valid, but the conclusion does not hold in A, but one "level" above, so it does not contradict Goedels theorem. Am I reading this right?

Guidelines | FAQ | Support | API | Security | Lists | Bookmarklet | Legal | Apply to YC | Contact