Exclusive disjunction: Difference between revisions

Latest revision as of 01:46, 31 October 2015

☞ This page belongs to resource collections on Logic and Inquiry.

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~\operatorname {XOR} ~q,$ also written $p+q\!$ or $p\neq q,\!$ appears below:

${\text{Exclusive Disjunction}}\!$
$p\!$	$q\!$	$p~\operatorname {XOR} ~q$
$\operatorname {F}$	$\operatorname {F}$	$\operatorname {F}$
$\operatorname {F}$	$\operatorname {T}$	$\operatorname {T}$
$\operatorname {T}$	$\operatorname {F}$	$\operatorname {T}$
$\operatorname {T}$	$\operatorname {T}$	$\operatorname {F}$

The following equivalents may then be deduced:

${\begin{matrix}p+q&=&(p\land \lnot q)&\lor &(\lnot p\land q)\\[6pt]&=&(p\lor q)&\land &(\lnot p\lor \lnot q)\\[6pt]&=&(p\lor q)&\land &\lnot (p\land q)\end{matrix}}$

Syllabus

Focal nodes

Peer nodes

Logical operators

Relational concepts

Information, Inquiry

Document history

Portions of the above article were adapted from the following sources under the GNU Free Documentation License, under other applicable licenses, or by permission of the copyright holders.

@@ Line 1: / Line 1: @@
-place holder
+<font size="3">&#9758;</font> This page belongs to resource collections on [[Logic Live|Logic]] and [[Inquiry Live|Inquiry]].
+'''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 <math>p ~\operatorname{XOR}~ q,</math> also written <math>p + q\!</math> or <math>p \ne q,\!</math> appears below:
+<br>
+{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:45%"
+|+ style="height:30px" | <math>\text{Exclusive Disjunction}\!</math>
+|- style="height:40px; background:#f0f0ff"
+| style="width:33%" | <math>p\!</math>
+| style="width:33%" | <math>q\!</math>
+| style="width:33%" | <math>p ~\operatorname{XOR}~ q</math>
+|-
+| <math>\operatorname{F}</math> || <math>\operatorname{F}</math> || <math>\operatorname{F}</math>
+|-
+| <math>\operatorname{F}</math> || <math>\operatorname{T}</math> || <math>\operatorname{T}</math>
+|-
+| <math>\operatorname{T}</math> || <math>\operatorname{F}</math> || <math>\operatorname{T}</math>
+|-
+| <math>\operatorname{T}</math> || <math>\operatorname{T}</math> || <math>\operatorname{F}</math>
+|}
+<br>
+The following equivalents may then be deduced:
+{| align="center" cellspacing="10" width="90%"
+|
+<math>\begin{matrix}
+p + q & = & (p \land \lnot q)  & \lor & (\lnot p \land q)
+\\[6pt]
+      & = & (p \lor q) & \land & (\lnot p \lor \lnot q)
+\\[6pt]
+      & = & (p \lor q) & \land & \lnot (p \land q)
+\end{matrix}</math>
+|}
+==Syllabus==
+===Focal nodes===
+* [[Inquiry Live]]
+* [[Logic Live]]
+===Peer nodes===
+* [http://intersci.ss.uci.edu/wiki/index.php/Exclusive_disjunction Exclusive Disjunction @ InterSciWiki]
+* [http://mywikibiz.com/Exclusive_disjunction Exclusive Disjunction @ MyWikiBiz]
+* [http://ref.subwiki.org/wiki/Exclusive_disjunction Exclusive Disjunction @ Subject Wikis]
+* [http://en.wikiversity.org/wiki/Exclusive_disjunction Exclusive Disjunction @ Wikiversity]
+* [http://beta.wikiversity.org/wiki/Exclusive_disjunction Exclusive Disjunction @ Wikiversity Beta]
+===Logical operators===
+{{col-begin}}
+{{col-break}}
+* [[Exclusive disjunction]]
+* [[Logical conjunction]]
+* [[Logical disjunction]]
+* [[Logical equality]]
+{{col-break}}
+* [[Logical implication]]
+* [[Logical NAND]]
+* [[Logical NNOR]]
+* [[Logical negation|Negation]]
+{{col-end}}
+===Related topics===
+{{col-begin}}
+{{col-break}}
+* [[Ampheck]]
+* [[Boolean domain]]
+* [[Boolean function]]
+* [[Boolean-valued function]]
+* [[Differential logic]]
+{{col-break}}
+* [[Logical graph]]
+* [[Minimal negation operator]]
+* [[Multigrade operator]]
+* [[Parametric operator]]
+* [[Peirce's law]]
+{{col-break}}
+* [[Propositional calculus]]
+* [[Sole sufficient operator]]
+* [[Truth table]]
+* [[Universe of discourse]]
+* [[Zeroth order logic]]
+{{col-end}}
+===Relational concepts===
+{{col-begin}}
+{{col-break}}
+* [[Continuous predicate]]
+* [[Hypostatic abstraction]]
+* [[Logic of relatives]]
+* [[Logical matrix]]
+{{col-break}}
+* [[Relation (mathematics)|Relation]]
+* [[Relation composition]]
+* [[Relation construction]]
+* [[Relation reduction]]
+{{col-break}}
+* [[Relation theory]]
+* [[Relative term]]
+* [[Sign relation]]
+* [[Triadic relation]]
+{{col-end}}
+===Information, Inquiry===
+{{col-begin}}
+{{col-break}}
+* [[Inquiry]]
+* [[Dynamics of inquiry]]
+{{col-break}}
+* [[Semeiotic]]
+* [[Logic of information]]
+{{col-break}}
+* [[Descriptive science]]
+* [[Normative science]]
+{{col-break}}
+* [[Pragmatic maxim]]
+* [[Truth theory]]
+{{col-end}}
+===Related articles===
+{{col-begin}}
+{{col-break}}
+* [http://intersci.ss.uci.edu/wiki/index.php/Cactus_Language Cactus Language]
+* [http://intersci.ss.uci.edu/wiki/index.php/Futures_Of_Logical_Graphs Futures Of Logical Graphs]
+* [http://intersci.ss.uci.edu/wiki/index.php/Propositional_Equation_Reasoning_Systems Propositional Equation Reasoning Systems]
+{{col-break}}
+* [http://intersci.ss.uci.edu/wiki/index.php/Differential_Logic_:_Introduction Differential Logic : Introduction]
+* [http://intersci.ss.uci.edu/wiki/index.php/Differential_Propositional_Calculus Differential Propositional Calculus]
+* [http://intersci.ss.uci.edu/wiki/index.php/Differential_Logic_and_Dynamic_Systems_2.0 Differential Logic and Dynamic Systems]
+{{col-break}}
+* [http://intersci.ss.uci.edu/wiki/index.php/Prospects_for_Inquiry_Driven_Systems Prospects for Inquiry Driven Systems]
+* [http://intersci.ss.uci.edu/wiki/index.php/Introduction_to_Inquiry_Driven_Systems Introduction to Inquiry Driven Systems]
+* [http://intersci.ss.uci.edu/wiki/index.php/Inquiry_Driven_Systems Inquiry Driven Systems : Inquiry Into Inquiry]
+{{col-end}}
+==Document history==
+Portions of the above article were adapted from the following sources under the [[GNU Free Documentation License]], under other applicable licenses, or by permission of the copyright holders.
+* [http://intersci.ss.uci.edu/wiki/index.php/Exclusive_disjunction Exclusive Disjunction], [http://intersci.ss.uci.edu/ InterSciWiki]
+* [http://mywikibiz.com/Exclusive_disjunction Exclusive Disjunction], [http://mywikibiz.com/ MyWikiBiz]
+* [http://ref.subwiki.org/wiki/Exclusive_disjunction Exclusive Disjunction], [http://ref.subwiki.org/ Subject Wikis]
+* [http://wikinfo.org/w/index.php/Exclusive_disjunction Exclusive Disjunction], [http://wikinfo.org/w/ Wikinfo]
+* [http://en.wikiversity.org/wiki/Exclusive_disjunction Exclusive Disjunction], [http://en.wikiversity.org/ Wikiversity]
+* [http://beta.wikiversity.org/wiki/Exclusive_disjunction Exclusive Disjunction], [http://beta.wikiversity.org/ Wikiversity Beta]
+* [http://en.wikipedia.org/w/index.php?title=Exclusive_disjunction&oldid=75153068 Exclusive Disjunction], [http://en.wikipedia.org/ Wikipedia]
+[[Category:Inquiry]]
+[[Category:Open Educational Resource]]
+[[Category:Peer Educational Resource]]
+[[Category:Charles Sanders Peirce]]
+[[Category:Computer Science]]
+[[Category:Formal Languages]]
+[[Category:Formal Sciences]]
+[[Category:Formal Systems]]
+[[Category:Linguistics]]
+[[Category:Logic]]
+[[Category:Mathematics]]
+[[Category:Philosophy]]
+[[Category:Semiotics]]