FOM: Goldbach's Conjecture

[Kanovei]

<Date: Fri, 27 Feb 1998 09:27:54 -0500 (EST)
<From: Charles Silver <csilver at sophia.smith.edu>

<	Would you want to refute the following argument (why or why not?): 
<If Goldbach's Conjecture were proven to be formally undecidable in PA, it
<must then be true.

The exact form of this argument is: 

THEOREM (ZFC). If PA does not prove that the Goldbach Conjecture 
(GC) fails, then GC is true.

ZFC can be replaced by Z, 2nd order arithmetic, perhaps even 
the topos theory, but I do not know whether we can start this: 
THEOREM (PA). 

V.Kanovei