Exclusive disjunction: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

20 October 2025

  • curprev 14:2914:29, 20 October 2025‎ Bfh-sts talk contribs‎ 959 bytes +959‎ 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..."
Retrieved from "https://bsccs.stoney-wiki.com/wiki/Exclusive_disjunction"