Date: Apr 6, 2013 9:42 AM
Subject: Re: Matheology § 224
On 6 Apr., 15:32, Peter Percival
> 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.
Not necessarily. It could also be that a proof or disproof requires
more bits than are available.