Difference between revisions of "Exclusive disjunction"
MyWikiBiz, Author Your Legacy — Friday November 29, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) |
Jon Awbrey (talk | contribs) |
||
| Line 66: | Line 66: | ||
* [[Zeroth order logic]] | * [[Zeroth order logic]] | ||
{{col-end}} | {{col-end}} | ||
| − | |||
| − | |||
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
| Line 78: | Line 76: | ||
[[Category:Philosophy]] | [[Category:Philosophy]] | ||
[[Category:Semiotics]] | [[Category:Semiotics]] | ||
| + | |||
| + | <sharethis /> | ||
Revision as of 14:14, 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}\]
