Gödel proved that there are true sentences that cannot be proved.
Suppose I told you that the Goldbach conjecture is one of those. (The Goldbach conjecture supposes that every even integer number can be expressed as the sum of two odd primes.)
Is that logically possible? (And, no, I haven't proved it!)
(In reply to re(2): Waiting for Godel (Spoiler)
Yes I noticed by many of your postings that you have quite a wit about you.
Thanks for the info. I found it quite interesting but far too complex to just absorb (too many references to ordinals cardinals and recursives and wouldn't you know it SYMBOLS). I got the general idea though.
Now back to the puzzle. I think it is possible but improbable.