
Exclusive or
True when either but not both inputs are true / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Exclusive disjunction?
Summarize this article for a 10 years old
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]
XOR | |
---|---|
![]() | |
Truth table | |
Logic gate | ![]() |
Normal forms | |
Disjunctive | |
Conjunctive | |
Zhegalkin polynomial | |
Post's lattices | |
0-preserving | yes |
1-preserving | no |
Monotone | no |
Affine | yes |

It is symbolized by the prefix operator J[2] and by the infix operators XOR (/ˌɛks ˈɔːr/, /ˌɛks ˈɔː/, /ˈksɔːr/ or /ˈksɔː/), 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,...).