Binary Logical Connective is Self-Inverse iff Exclusive Or

Theorem
Let $\circ$ be a binary logical connective.

Then:
 * $\left({p \circ q}\right) \circ q \dashv \vdash p$

iff $\circ$ is the exclusive or operator.

That is, the only boolean function which is self-inverse is the exclusive or.