Was (wer) ist XOR - definition
![Arguments on the left combined by XOR. This is a binary [[Walsh matrix]] (cf. [[Hadamard code]]).](https://commons.wikimedia.org/wiki/Special:FilePath/Multigrade operator XOR.svg?width=200 "Arguments on the left combined by XOR. This is a binary [[Walsh matrix]] (cf. [[Hadamard code]]).")
![Traditional symbolic representation of an XOR [[logic gate]]](https://commons.wikimedia.org/wiki/Special:FilePath/XOR ANSI Labelled.svg?width=200 "Traditional symbolic representation of an XOR [[logic gate]]")
![binary]] representation. This is also the vector addition in <math>(\Z/2\Z)^4</math>.](https://commons.wikimedia.org/wiki/Special:FilePath/Z2^4; Cayley table; binary.svg?width=200 "binary]] representation. This is also the vector addition in <math>(\Z/2\Z)^4</math>.")
Wikipedia
Exclusive or or exclusive disjunction is a logical operation that is true if and only if its arguments differ (one is true, the other is false).
It is symbolized by the prefix operator J and by the infix operators XOR (, , or ), EOR, EXOR, ⊻, ⩒, ⩛, ⊕, , and ≢. The negation of XOR is the logical biconditional, which yields true if and only if the two inputs are the same.
It gains the name "exclusive or" because the meaning of "or" is ambiguous when both operands are true; the exclusive or operator excludes that case. This is sometimes thought of as "one or the other but not both". This could be written as "A or B, but not, A and B".
Since it is associative, it may be considered to be an n-ary operator which is true if and only if an odd number of arguments are true. That is, a XOR b XOR ... may be treated as XOR(a,b,...).
