XOR
XOR is a connective in logic known as the "exclusive or, " or exclusive disjunction. It yields true if exactly one (but not both) of two conditions is true. The XOR operation does not have a standard symbol, but is sometimes denoted A ⊻ B (this work) or A⊕B (Simpson 1987, pp. 539 and 550-554). A ⊻ B is read "A aut B, " where "aut" is Latin for "or, but not both." The circuit diagram symbol for an XOR gate is illustrated above. In set theory, A ⊻ B is typically called the symmetric difference. The XOR function is implemented as Xor[predicate1, predicate2, ...]. The binary XOR operation A ⊻ B is identical to nonequivalence A not congruent B. A ⊻ B
AND | aut | binary operator | Boolean algebra | connective | logic | munching squares | NAND | NOR | NOT | OR | Pascal's triangle | symmetric difference | truth table | XNOR
