A binary logical connective, denoted

\begin{equation*} P \neq Q \quad \text{or} \quad P \oplus Q \end{equation*}

and read

“either \(P\) or \(Q\)”,

that is true if and only if

\(P\) and \(Q\) differ,

which is equivalent to

\begin{equation*} (P \land \lnot Q) \lor (\lnot P \land Q). \end{equation*}

(Levin 2021, sec. 0.2; Poole and Mackworth 2017, sec. 5.1)

---

• Synonyms
• Truth table