간단하게 말하면 Peano Axiom 으로 false 를 증명했다는 말인데, 그말인즉 아무거나 다 증명할 수 있단 말이지. 예를 들면 1+1=1 도 증명할수 있고, 1+1 은 1이 아니다도 증명할수있어. 하지만 넬슨의 증명이 틀렸다고 오늘 인정했네. Edward Nelson nelson@math.princeton.edu to fom show details 2:36 PM (3 hours ago) Terrence Tao, at http://golem.ph.utexas.edu/category/2011/09/ and independently Daniel Tausk (private communication) have found an irreparable error in my outline. In the Kritchman-Raz proof, there is a low complexity proof of K(\bar\xi)>\ell if we assume \mu=1, but the Chaitin machine may find a shorter proof of high complexity, with no control over how high. My thanks to Tao and Tausk for spotting this. I withdraw my claim. The consistency of P remains an open problem. Ed Nelson