# (H9) Proof of Incompatibilism1

Selmer Bringsjord
Philosophy of AI

Here, first, is the basic setup:

• Let P' denote any true proposition whatsoever.
• Let L' denote the conjunction of all the laws of nature.
• Let P0' denote the conjunction of all facts about the universe at some point in the remote past, during the age of dinosaurs, say.
• Let the operator N' be such that the result of prefixing it to some proposition p is to say that `p is true, and no one has, or ever had, any choice about whether p.'
• We employ two rules of inference that seem to be above reproach, viz.,
N( ), N Nq

Now here is the proof:

1.
((P L) P) (definition of determinism)
2.
(P (L P)) (from 1)
3.
N(P (L P)) (from 2 by )
4.
NP0 (premise)
5.
N(L P) (from 3 and 4 by )
6.
NL (premise)
7.
NP (from 5 and 6 by )

Since P can stand for any true proposition, let it stand for your decision to vote for the candidate of your choice. The proof shows that no one has, or ever had, any choice about whether you voted this way or not.