[mojomark]

>> Then suppose that we have proved that P is both true and false. Since we have proved P true, we have proved that at least one of P or Q is true. But because we have also proved that Pis false, we may conclude that Q is true. Q.E.D. This proof is as simple as can be.

Say what now? How do you prove that something is both true and false. Maybe the OP is talking loosely about quantum superposition of a particle? However, that isn't proving a state is both true AND false, it's proving the state is undetermined (neither true nor false, but a hybrid state). I stopped reading here.

[undershirt]

Gödel gave an example of this by making a system of arithmetic generate statements about itself, and proved that it can't generate all possible truth statements (completeness) without generating some false ones (inconsistency). So, logic as cold machinery can start from the same axioms to prove that something is true in one path and then prove it false from another path. Logic is a world with its own rules that we can map reality onto sometimes but not always. The book Gödel's Proof does a good job describing this.

A larger and more devastating argument I've heard recently is that in order to even create logical statements, you need to be arguing from a worldview that can give an account for the existence of logic that isn't arbitrary (e.g. not "it just is"). And the argument goes that if you can't justify the existence of the tool, you can't justify its usage. This is devastating because if you believe it, then you suddenly must recognize that something prior to and higher than logic must exist in order to inform you of its existence, and it is not subject to the bounds of any logical system founded arbitrarily, but becomes the means by which logic itself coheres into something meaningful.

[082349872349872]

The pragmatic CS sol'n is to ground logic via truth tables. There are only two bools, so displaying a few bool*bool->bool operators is really not that much data. (data = those which have been given)

[082349872349872]

> 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)

[sp332]

You're missing out, the article does give an example.