On 06/04/2013 9:15 AM, Peter Percival wrote: > Nam Nguyen wrote: > >> In any rate do you agree that my statement: >> >> >>> But if GC is undecidable in PA, there's no proof left in FOL but >> >>> _structure theoretically verifying_ the truth value of GC in >> >> is correct? > > No, a little upstream I wrote > > If the Goldbach conjecture is undecidable in PA then it is true. > > which is a quite uncontroversial claim.
Well then one can't expect a fruitful argument about mathematical _logic_ matters with those whose counter reasoning is based on such a basis as "uncontroversial claim".
It kind of reminds me the time when I was in high-school arguing with my friends about the motion paradox (Zeno paradox) and when we (I included) got stuck in convincing the others, we used the _arguments_ like:
- "but it's so clear that ..." - "you must admit that ..." - "it's so true beyond any doubt that ..."