Prove that either
a) this problem is solvable
or
b) this problem is unsolvable
(In reply to
re: baffled by friedlinguini)
Proving (b) is certainly not possible, because to do it solves the problem. Because of the self-refential nature of this problem, the inability to prove (b) implies ~b. So the answer cannot be (b).
It can't be neither, because (as TomM pointed out), (a ∪ ~a) ⇒ T, because (I think I can hold that) unsolvable == ~solvable.
Therefore it must be solvable.
|
Posted by Paul
on 2002-08-19 08:27:11 |