If 
and 
(i.e., 
, where 
denotes NOT, 
denotes implies, and 
denotes AND),
then 
and 
are said to be inequivalent, a relationship which is written symbolically as 
, ![A<=>AdjustmentBox[/, BoxMargins -> {{-1.05, 0.13913}, {-0.5, 0.5}}]B](/images/equations/Nonequivalent/Inline10.svg)
,
or ![A<->AdjustmentBox[/, BoxMargins -> {{-1, 0.13913}, {-0.5, 0.5}}]B](/images/equations/Nonequivalent/Inline11.svg)
.
Nonequivalence is implemented in the Wolfram
Language as Unequal[A,
B, ...]. Binary nonequivalence has the same truth
table as XOR (i.e., exclusive
disjunction), reproduced below.
 |  |  |
| T | T | F |
| T | F | T |
| F | T | T |
| F | F | F |
