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?
( Remember the definitions of language structure and that of formal system are _independent from each other_ .)
-- ---------------------------------------------------- There is no remainder in the mathematics of infinity.
