Hacker News new | ask | show | jobs
by 082349872349872 790 days ago
> How do you prove that something is both true and false

By displaying two different trees, both well-formed with respect to (nodes from and leaves that are axioms of) the logic, one of which shows that the thing is true and the other which shows it false.

(we don't usually care about this possibility because if we take care to use consistent logics, whenever we have two proofs P and Q with truth values V and W respectively, then V=W)