NAND is not Associative/Proof by Truth Table

Theorem
Let $\uparrow$ signify the NAND operation.

Then there exist propositions $p,q,r$ such that:


 * $p \uparrow \left({q \uparrow r}\right) \not \vdash \left({p \uparrow q}\right) \uparrow r$

That is, NAND is not associative.

Proof
We apply the Method of Truth Tables:


 * $\begin{array}{|ccccc||ccccc|} \hline

p & \uparrow & (q & \uparrow & r) & (p & \uparrow & q) & \uparrow & r \\ \hline F & T & F & T & F & F & T & F & T & F \\ F & T & F & T & T & F & T & F & F & T \\ F & T & T & T & F & F & T & T & T & F \\ F & T & T & F & T & F & T & T & F & T \\ T & F & F & T & F & T & T & F & T & F \\ T & F & F & T & T & T & T & F & F & T \\ T & F & T & T & F & T & F & T & T & F \\ T & T & T & F & T & T & F & T & T & T \\ \hline \end{array}$

As can be seen by inspection, the truth values under the main connectives do not match for all boolean interpretations.