https://bsccs.stoney-wiki.com/w/index.php?action=history&feed=atom&title=Exclusive_disjunctionExclusive disjunction - Revision history2026-05-04T20:08:08ZRevision history for this page on the wikiMediaWiki 1.39.6https://bsccs.stoney-wiki.com/w/index.php?title=Exclusive_disjunction&diff=31&oldid=prevBfh-sts: Created page with "= Exclusive disjunction = Exclusive disjunction (often abbreviated as XOR) is the logical operation that returns true if exactly one of the propositions is true, but not both. == Symbols == * p ⊕ q (standard notation) * p XOR q (common in computer science) * (p ∨ q) ∧ ¬(p ∧ q) (definition using basic operators) == Definition == The exclusive disjunction ''p ⊕ q'' is true if either ''p'' or ''q'' is true, but false if both are true or both are false. == Tru..."2025-10-20T13:29:04Z<p>Created page with "= Exclusive disjunction = Exclusive disjunction (often abbreviated as XOR) is the logical operation that returns true if exactly one of the propositions is true, but not both. == Symbols == * p ⊕ q (standard notation) * p XOR q (common in computer science) * (p ∨ q) ∧ ¬(p ∧ q) (definition using basic operators) == Definition == The exclusive disjunction ''p ⊕ q'' is true if either ''p'' or ''q'' is true, but false if both are true or both are false. == Tru..."</p>
<p><b>New page</b></p><div>= Exclusive disjunction =<br />
<br />
Exclusive disjunction (often abbreviated as XOR) is the logical operation that returns true if exactly one of the propositions is true, but not both.<br />
<br />
== Symbols ==<br />
* p ⊕ q (standard notation)<br />
* p XOR q (common in computer science)<br />
* (p ∨ q) ∧ ¬(p ∧ q) (definition using basic operators)<br />
<br />
== Definition ==<br />
The exclusive disjunction ''p ⊕ q'' is true if either ''p'' or ''q'' is true, but false if both are true or both are false.<br />
<br />
== Truth Table ==<br />
{| class="wikitable"<br />
! p !! q !! p ⊕ q<br />
|-<br />
| T || T || F<br />
|-<br />
| T || F || T<br />
|-<br />
| F || T || T<br />
|-<br />
| F || F || F<br />
|}<br />
<br />
== Examples ==<br />
* If ''p'' = "I go jogging" and ''q'' = "I go swimming", <br />
then ''p ⊕ q'' = "I go jogging or swimming, but not both".<br />
* In Python: <code>p ^ q</code> (when p and q are booleans)<br />
* In Java: <code>p ^ q</code> (when p and q are booleans)<br />
<br />
<br />
[[Category:Propositional logic (Aussagenlogik)]]<br />
[[Category: Diskrete Mathematik I (BZG1155pa) 25/26]]</div>Bfh-sts