Binary Logical Connective is Self-Inverse iff Exclusive Or

Source Work

 * Chapter $2$: Propositional Calculus
 * $2.1$. Boolean Operations
 * $2.1$. Boolean Operations

Mistake
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.


 * "$\mathsf{XOR}$ is also essential since it is the only operator having an inverse, namely itself
 * $\left({p \oplus q}\right) \oplus q = p$"

Incorrect, as the biconditional operator has the same properties:
 * $\left({\left({p \iff q}\right) \iff q}\right) = p$

Proof
See Binary Logical Connectives with Inverse.