FOM: Goldbach's Conjecture
wtait at ix.netcom.com
Sat Feb 28 08:49:55 EST 1998
>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:
\phi \implies provable_PA(`\phi') is a theorem of PA for any \Sigma_1
sentence \phi, including \\phi = not-GC.
More information about the FOM