Exclusive or
XOR  

Truth table  [math]\displaystyle{ (0110) }[/math] 
Logic gate  
Normal forms  
Disjunctive  [math]\displaystyle{ \overline{x} \cdot y + x \cdot \overline{y} }[/math] 
Conjunctive  [math]\displaystyle{ ( \overline{x} + \overline{y} ) \cdot ( x + y ) }[/math] 
Zhegalkin polynomial  [math]\displaystyle{ x \oplus y }[/math] 
white;">Post's lattices  
0preserving  yes 
1preserving  no 
Monotone  no 
Affine  yes 
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).^{[1]}
It is symbolized by the prefix operator J^{[2]} and by the infix operators XOR (/ˌɛks ˈɔːr/, /ˌɛks ˈɔː/, /ˈksɔːr/ or /ˈksɔː/), EOR, EXOR, ⊻, ⩒, ⩛, ⊕, [math]\displaystyle{ \nleftrightarrow }[/math], 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 nary 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,...).
Truth table
The truth table of A XOR B shows that it outputs true whenever the inputs differ:
[math]\displaystyle{ A }[/math]  [math]\displaystyle{ B }[/math]  [math]\displaystyle{ A \oplus B }[/math] 
False  False  False 
False  True  True 
True  False  True 
True  True  False 
Equivalences, elimination, and introduction
Exclusive disjunction essentially means 'either one, but not both nor none'. In other words, the statement is true if and only if one is true and the other is false. For example, if two horses are racing, then one of the two will win the race, but not both of them. The exclusive disjunction [math]\displaystyle{ p \nleftrightarrow q }[/math], also denoted by [math]\displaystyle{ p }[/math] ? [math]\displaystyle{ q }[/math] or [math]\displaystyle{ \operatorname{J}pq }[/math], can be expressed in terms of the logical conjunction ("logical and", [math]\displaystyle{ \wedge }[/math]), the disjunction ("logical or", [math]\displaystyle{ \lor }[/math]), and the negation ([math]\displaystyle{ \lnot }[/math]) as follows:
 [math]\displaystyle{ \begin{matrix} p \nleftrightarrow q & = & (p \lor q) \land \lnot (p \land q) \end{matrix} }[/math]
The exclusive disjunction [math]\displaystyle{ p \nleftrightarrow q }[/math] can also be expressed in the following way:
 [math]\displaystyle{ \begin{matrix} p \nleftrightarrow q & = & (p \land \lnot q) \lor (\lnot p \land q) \end{matrix} }[/math]
This representation of XOR may be found useful when constructing a circuit or network, because it has only one [math]\displaystyle{ \lnot }[/math] operation and small number of [math]\displaystyle{ \wedge }[/math] and [math]\displaystyle{ \lor }[/math] operations. A proof of this identity is given below:
 [math]\displaystyle{ \begin{matrix} p \nleftrightarrow q & = & (p \land \lnot q) & \lor & (\lnot p \land q) \\[3pt] & = & ((p \land \lnot q) \lor \lnot p) & \land & ((p \land \lnot q) \lor q) \\[3pt] & = & ((p \lor \lnot p) \land (\lnot q \lor \lnot p)) & \land & ((p \lor q) \land (\lnot q \lor q)) \\[3pt] & = & (\lnot p \lor \lnot q) & \land & (p \lor q) \\[3pt] & = & \lnot (p \land q) & \land & (p \lor q) \end{matrix} }[/math]
It is sometimes useful to write [math]\displaystyle{ p \nleftrightarrow q }[/math] in the following way:
 [math]\displaystyle{ \begin{matrix} p \nleftrightarrow q & = & \lnot ((p \land q) \lor (\lnot p \land \lnot q)) \end{matrix} }[/math]
or:
 [math]\displaystyle{ \begin{matrix} p \nleftrightarrow q & = & (p \lor q) \land (\lnot p \lor \lnot q) \end{matrix} }[/math]
This equivalence can be established by applying De Morgan's laws twice to the fourth line of the above proof.
The exclusive or is also equivalent to the negation of a logical biconditional, by the rules of material implication (a material conditional is equivalent to the disjunction of the negation of its antecedent and its consequence) and material equivalence.
In summary, we have, in mathematical and in engineering notation:
 [math]\displaystyle{ \begin{matrix} p \nleftrightarrow q & = & (p \land \lnot q) & \lor & (\lnot p \land q) & = & p\overline{q} + \overline{p}q \\[3pt] & = & (p \lor q) & \land & (\lnot p \lor \lnot q) & = & (p + q)(\overline{p} + \overline{q}) \\[3pt] & = & (p \lor q) & \land & \lnot (p \land q) & = & (p + q)(\overline{pq}) \end{matrix} }[/math]
Negation
The spirit of De Morgan's laws can be applied, we have: [math]\displaystyle{ \lnot(p \nleftrightarrow q) = \lnot p \nleftrightarrow q = p \nleftrightarrow \lnot q }[/math]
Relation to modern algebra
Although the operators [math]\displaystyle{ \wedge }[/math] (conjunction) and [math]\displaystyle{ \lor }[/math] (disjunction) are very useful in logic systems, they fail a more generalizable structure in the following way:
The systems [math]\displaystyle{ (\{T, F\}, \wedge) }[/math] and [math]\displaystyle{ (\{T, F\}, \lor) }[/math] are monoids, but neither is a group. This unfortunately prevents the combination of these two systems into larger structures, such as a mathematical ring.
However, the system using exclusive or [math]\displaystyle{ (\{T, F\}, \oplus) }[/math] is an abelian group. The combination of operators [math]\displaystyle{ \wedge }[/math] and [math]\displaystyle{ \oplus }[/math] over elements [math]\displaystyle{ \{T, F\} }[/math] produce the wellknown field [math]\displaystyle{ F 2 }[/math]. This field can represent any logic obtainable with the system [math]\displaystyle{ (\land, \lor) }[/math] and has the added benefit of the arsenal of algebraic analysis tools for fields.
More specifically, if one associates [math]\displaystyle{ F }[/math] with 0 and [math]\displaystyle{ T }[/math] with 1, one can interpret the logical "AND" operation as multiplication on [math]\displaystyle{ F_2 }[/math] and the "XOR" operation as addition on [math]\displaystyle{ F_2 }[/math]:
 [math]\displaystyle{ \begin{matrix} r = p \land q & \Leftrightarrow & r = p \cdot q \pmod 2 \\[3pt] r = p \oplus q & \Leftrightarrow & r = p + q \pmod 2 \\ \end{matrix} }[/math]
Using this basis to describe a boolean system is referred to as algebraic normal form.
Exclusive or in natural language
Disjunction is often understood exclusively in natural languages. In English, the disjunctive word "or" is often understood exclusively, particularly when used with the particle "either". The English example below would normally be understood in conversation as implying that Mary is not both a singer and a poet.^{[3]}^{[4]}
 1. Mary is a singer or a poet.
However, disjunction can also be understood inclusively, even in combination with "either". For instance, the first example below shows that "either" can be felicitously used in combination with an outright statement that both disjuncts are true. The second example shows that the exclusive inference vanishes away under downward entailing contexts. If disjunction were understood as exclusive in this example, it would leave open the possibility that some people ate both rice and beans.^{[3]}
 2. Mary is either a singer or a poet or both.
 3. Nobody ate either rice or beans.
Examples such as the above have motivated analyses of the exclusivity inference as pragmatic conversational implicatures calculated on the basis of an inclusive semantics. Implicatures are typically cancellable and do not arise in downward entailing contexts if their calculation depends on the Maxim of Quantity. However, some researchers have treated exclusivity as a bona fide semantic entailment and proposed nonclassical logics which would validate it.^{[3]}
This behavior of English "or" is also found in other languages. However, many languages have disjunctive constructions which are robustly exclusive such as French soit... soit.^{[3]}
Alternative symbols
The symbol used for exclusive disjunction varies from one field of application to the next, and even depends on the properties being emphasized in a given context of discussion. In addition to the abbreviation "XOR", any of the following symbols may also be seen:
 +, a plus sign, which has the advantage that all of the ordinary algebraic properties of mathematical rings and fields can be used without further ado; but the plus sign is also used for inclusive disjunction in some notation systems; note that exclusive disjunction corresponds to addition modulo 2, which has the following addition table, clearly isomorphic to the one above:
[math]\displaystyle{ p }[/math]  [math]\displaystyle{ q }[/math]  [math]\displaystyle{ p+q }[/math] 

0  0  0 
0  1  1 
1  0  1 
1  1  0 
 [math]\displaystyle{ \oplus }[/math], a modified plus sign; this symbol is also used in mathematics for the direct sum of algebraic structures
 J, as in Jpq
 An inclusive disjunction symbol ([math]\displaystyle{ \lor }[/math]) that is modified in some way, such as
 [math]\displaystyle{ \underline\lor }[/math]
 [math]\displaystyle{ \dot\vee }[/math]
 ^, the caret, used in several programming languages, such as C, C++, C#, D, Java, Perl, Ruby, PHP and Python, denoting the bitwise XOR operator; not used outside of programming contexts because it is too easily confused with other uses of the caret such as exponentiation.
 , sometimes written as
 ><
 ><
 =1, in IEC symbology
Properties
 Commutativity: yes

[math]\displaystyle{ A \oplus B }[/math] [math]\displaystyle{ \Leftrightarrow }[/math] [math]\displaystyle{ B \oplus A }[/math] [math]\displaystyle{ \Leftrightarrow }[/math]  Associativity: yes
 Distributivity:
 The exclusive or doesn't distribute over any binary function (not even itself), but logical conjunction distributes over exclusive or. [math]\displaystyle{ C\land(A \oplus B )= (C\land A) \oplus (C\land B) }[/math] (Conjunction and exclusive or form the multiplication and addition operations of a field GF(2), and as in any field they obey the distributive law.)
 Idempotency: no
 Monotonicity: no
 Truthpreserving: no
 When all inputs are true, the output is not true.
[math]\displaystyle{ A \land B }[/math] [math]\displaystyle{ \nRightarrow }[/math] [math]\displaystyle{ A \oplus B }[/math] [math]\displaystyle{ \nRightarrow }[/math]  Falsehoodpreserving: yes
 When all inputs are false, the output is false.
[math]\displaystyle{ A \oplus B }[/math] [math]\displaystyle{ \Rightarrow }[/math] [math]\displaystyle{ A \lor B }[/math] [math]\displaystyle{ \Rightarrow }[/math]  Walsh spectrum: (2,0,0,−2)
 Nonlinearity: 0
 The function is linear.
If using binary values for true (1) and false (0), then exclusive or works exactly like addition modulo 2.
Computer science
Bitwise operation
Exclusive disjunction is often used for bitwise operations. Examples:
 1 XOR 1 = 0
 1 XOR 0 = 1
 0 XOR 1 = 1
 0 XOR 0 = 0
 11102 XOR 10012 = 01112 (this is equivalent to addition without carry)
As noted above, since exclusive disjunction is identical to addition modulo 2, the bitwise exclusive disjunction of two nbit strings is identical to the standard vector of addition in the vector space [math]\displaystyle{ (\Z/2\Z)^n }[/math].
In computer science, exclusive disjunction has several uses:
 It tells whether two bits are unequal.
 It is an optional bitflipper (the deciding input chooses whether to invert the data input).
 It tells whether there is an odd number of 1 bits ([math]\displaystyle{ A \oplus B \oplus C \oplus D \oplus E }[/math] is true if and only if an odd number of the variables are true), which is equal to the parity bit returned by a parity function.
In logical circuits, a simple adder can be made with an XOR gate to add the numbers, and a series of AND, OR and NOT gates to create the carry output.
On some computer architectures, it is more efficient to store a zero in a register by XORing the register with itself (bits XORed with themselves are always zero) instead of loading and storing the value zero.
In simple thresholdactivated neural networks, modeling the XOR function requires a second layer because XOR is not a linearly separable function.
Exclusiveor is sometimes used as a simple mixing function in cryptography, for example, with onetime pad or Feistel network systems.
Exclusiveor is also heavily used in block ciphers such as AES (Rijndael) or Serpent and in block cipher implementation (CBC, CFB, OFB or CTR).
Similarly, XOR can be used in generating entropy pools for hardware random number generators. The XOR operation preserves randomness, meaning that a random bit XORed with a nonrandom bit will result in a random bit. Multiple sources of potentially random data can be combined using XOR, and the unpredictability of the output is guaranteed to be at least as good as the best individual source.^{[5]}
XOR is used in RAID 3–6 for creating parity information. For example, RAID can "back up" bytes 100111002 and 011011002 from two (or more) hard drives by XORing the just mentioned bytes, resulting in (111100002) and writing it to another drive. Under this method, if any one of the three hard drives are lost, the lost byte can be recreated by XORing bytes from the remaining drives. For instance, if the drive containing 011011002 is lost, 100111002 and 111100002 can be XORed to recover the lost byte.^{[6]}
XOR is also used to detect an overflow in the result of a signed binary arithmetic operation. If the leftmost retained bit of the result is not the same as the infinite number of digits to the left, then that means overflow occurred. XORing those two bits will give a "1" if there is an overflow.
XOR can be used to swap two numeric variables in computers, using the XOR swap algorithm; however this is regarded as more of a curiosity and not encouraged in practice.
XOR linked lists leverage XOR properties in order to save space to represent doubly linked list data structures.
In computer graphics, XORbased drawing methods are often used to manage such items as bounding boxes and cursors on systems without alpha channels or overlay planes.
Encodings
It is also called "not leftright arrow" (\nleftrightarrow
) in LaTeXbased markdown ([math]\displaystyle{ \nleftrightarrow }[/math]). Apart from the ASCII codes, the operator is encoded at U+22BB ⊻ XOR (HTML ⊻
) and U+2295 ⊕ CIRCLED PLUS (HTML ⊕
· ⊕
), both in block mathematical operators.
See also
Notes
 ↑ Germundsson, Roger; Weisstein, Eric. "XOR". Wolfram Research. http://mathworld.wolfram.com/XOR.html.
 ↑ Craig, Edward, ed. (1998), Routledge Encyclopedia of Philosophy, 10, Taylor & Francis, p. 496, ISBN 9780415073103, https://books.google.com/books?id=HP9O6OM4iOgC&pg=PA496
 ↑ ^{3.0} ^{3.1} ^{3.2} ^{3.3} Aloni, Maria (2016), Zalta, Edward N., ed., Disjunction (Winter 2016 ed.), Metaphysics Research Lab, Stanford University, https://plato.stanford.edu/archives/win2016/entries/disjunction/, retrieved 20200903
 ↑ Jennings quotes numerous authors saying that the word "or" has an exclusive sense. See Chapter 3, "The First Myth of 'Or'":
Jennings, R. E. (1994). The Genealogy of Disjunction. New York: Oxford University Press.  ↑ Davies, Robert B (28 February 2002). "Exclusive OR (XOR) and hardware random number generators". http://www.robertnz.net/pdf/xor2.pdf.
 ↑ Nobel, Rickard (26 July 2011). "How RAID 5 actually works". http://rickardnobel.se/howraid5works.
External links
 All About XOR
 Proofs of XOR properties and applications of XOR, CS103: Mathematical Foundations of Computing, Stanford University
Original source: https://en.wikipedia.org/wiki/Exclusive or.
Read more 