One variant of this logical operation computes the sum, not the carry out, in half adders and full adders. A bitwise variant of this logical operation is represented by a caret in C, is true only when the bits differ, and is the exclusive type. In C, the bitwise and logical forms of this operation are represented by a single pipe symbol and two pipe symbols, respectively. 
One variant of this logical operation computes the sum, not the carry out, in half adders and full adders. A bitwise variant of this logical operation is represented by a caret in C, is true only when the bits differ, and is the exclusive type. In C, the bitwise and logical forms of this operation are represented by a single pipe symbol and two pipe symbols, respectively. Taking the (*) union of a set is equivalent to this logical operation. According to De Morgan's laws, the not of the expression that contains this operation performed on A and B is equal to not A dot not B. It is often represented by plus. For 10 points, name this operation that is true if any input is true and is contrasted with and.
One variant of this logical operation computes the sum, not the carry out, in half adders and full adders.
inclusive {or} [or logical {disjunction}; accept {U} or set {union} before "union" is read; accept {plus} before it is read]