On 6 Apr., 16:13, Nam Nguyen <namducngu...@shaw.ca> wrote: > On 06/04/2013 7:32 AM, Peter Percival wrote: > > > Nam Nguyen wrote: > > >> But if GC is undecidable in PA, there's no proof left in FOL but > >> _structure theoretically verifying_ the truth value of GC in > >> this structure. > > > If the Goldbach conjecture is undecidable in PA then it is true. > > Care to verify (prove) your claim here?
Goldbach conjecture is false. <==> Counter example exists. <==> Counter example can be found. <==> Goldbach conjecture is decidable.
The second equivalence requires to neglect reality. But in mathematics this is standard.