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: A better.... by e.g.)
Larry is right. If Godel proved that there are sentences that are true but cannot be proved, but didn't identify them, the Goldbach Conjecture might be one of them.
But that's just a conjecture. No human being knows whether it is. Only the mystic invisible pink unicorn knows for sure.
(btw, if it's invisible, how do you know it's pink ?)
|
|
Posted by Penny
on 2004-08-22 15:12:34 |
re(2): A better....
