Difference between revisions of "Exclusive disjunction"
MyWikiBiz, Author Your Legacy — Saturday November 23, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) |
Jon Awbrey (talk | contribs) (apply column template) |
||
| Line 32: | Line 32: | ||
==See also== | ==See also== | ||
===Logical operators=== | ===Logical operators=== | ||
| − | { | + | |
| − | + | {{col-begin}} | |
| + | {{col-break}} | ||
* [[Exclusive disjunction]] | * [[Exclusive disjunction]] | ||
* [[Logical conjunction]] | * [[Logical conjunction]] | ||
* [[Logical disjunction]] | * [[Logical disjunction]] | ||
* [[Logical equality]] | * [[Logical equality]] | ||
| − | + | {{col-break}} | |
* [[Logical implication]] | * [[Logical implication]] | ||
* [[Logical NAND]] | * [[Logical NAND]] | ||
* [[Logical NNOR]] | * [[Logical NNOR]] | ||
* [[Logical negation|Negation]] | * [[Logical negation|Negation]] | ||
| − | + | {{col-end}} | |
| + | |||
===Related topics=== | ===Related topics=== | ||
| − | { | + | |
| − | + | {{col-begin}} | |
| + | {{col-break}} | ||
* [[Ampheck]] | * [[Ampheck]] | ||
* [[Boolean algebra]] | * [[Boolean algebra]] | ||
* [[Boolean domain]] | * [[Boolean domain]] | ||
* [[Boolean function]] | * [[Boolean function]] | ||
| − | + | {{col-break}} | |
* [[Boolean logic]] | * [[Boolean logic]] | ||
* [[Laws of Form]] | * [[Laws of Form]] | ||
* [[Logic gate]] | * [[Logic gate]] | ||
* [[Logical graph]] | * [[Logical graph]] | ||
| − | + | {{col-break}} | |
* [[Peirce's law]] | * [[Peirce's law]] | ||
* [[Propositional calculus]] | * [[Propositional calculus]] | ||
* [[Sole sufficient operator]] | * [[Sole sufficient operator]] | ||
* [[Zeroth order logic]] | * [[Zeroth order logic]] | ||
| − | + | {{col-end}} | |
| − | + | <sharethis /> | |
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
Revision as of 05:40, 25 May 2009
Exclusive disjunction, also known as logical inequality or symmetric difference, is an operation on two logical values, typically the values of two propositions, that produces a value of true just in case exactly one of its operands is true.
The truth table of p XOR q (also written as p + q or p ≠ q) is as follows:
| p | q | p XOR q |
|---|---|---|
| F | F | F |
| F | T | T |
| T | F | T |
| T | T | F |
The following equivalents can then be deduced:
\[\begin{matrix} p + q & = & (p \land \lnot q) & \lor & (\lnot p \land q) \\ \\ & = & (p \lor q) & \land & (\lnot p \lor \lnot q) \\ \\ & = & (p \lor q) & \land & \lnot (p \land q) \end{matrix}\]
