Cf: Logic Syllabus • Discussion 2
::: John Mingers ( https://groups.io/g/lawsofform/message/2328
Is [the “just one true” operator] the same or different to xor?
I have read that xor is true when an odd number of variables are
true which would make it different. But I also read somewhere that
xor was true when only one is true.
Here's my syllabus entry on Exclusive Disjunction (xor), also known
as Logical Inequality, Symmetric Difference, and a few other names.
It's my best effort so far at straightening out the reigning confusions
and also at highlighting the links between the various notations and
visualizations we find in practice.
Exclusive disjunction, also known as logical inequality or
symmetric difference, is an operation on two logical values,
typically the values of two propositions, which produces a
value of true just in case exactly one of its operands is true.
To say exactly one operand is true is to say the other is false,
which is to say the two operands are different, that is, unequal.
Expressed algebraically, x₁ + x₂ = 1 (mod 2).
Viewed in that light, it is tempting to think a natural extension of xor
to many variables x₁, …, xₘ will take the form x₁ + … + xₘ = 1 (mod 2).
And saying the bit sum of several boolean values is 1 is just another way
of saying an odd number of the values are 1.
Sums of that order form a perfectly good family of boolean functions,
ones we'll revisit in a different light, but their kinship to the family
of logical disjunctions is a bit more strained than uniquely natural.