Re: what makes it true?

Torkel Franzen <torkel@xxxxxxxxxx> writes:

> It's not a matter of accepting anything except a perfectly ordinary
> (and easily proved) mathematical theorem: if Goldbach's conjecture
> is undecidable in PA, then it is true, that is, every even number
> greater than 2 is the sum of two primes.

But then GC is not just true but also provable. However, if it's
provable, it can't be undecidable, so it must be decidable. Therefore
GC must be either provable or disprovable in PA.

--
Esa Peuha
student of mathematics at the University of Helsinki
http://www.helsinki.fi/~peuha/
.