It will take a few more rounds of stage-setting before I can get to concrete examples of applications but the following should indicate the direction of generalization embodied in minimal negation operators.
To begin, let’s observe two different ways of generalizing the operation of exclusive disjunction (XOR) or symmetric difference.
Let = the boolean domain
XOR or symmetric difference, sometimes indicated by a delta or small triangle is a boolean function identical to the field addition This is also known as addition mod 2 or GF(2) addition.
Generalizing in that sense would continue the sequence as and so on. These are known as parity sums, returning if there are an even number of ’s in the sum, returning if there are an odd number of ’s in the sum.
- The equivalent expressions can also be read with a different connotation, indicating the “next-door-neighbors” or venn diagram cells adjacent to the conjunction Generalizing in that direction would continue the sequence as and so on. That sequence of operators differs from the sequence of parity sums once it passes the 2-variable case.
The triple sum can be written in terms of 2-place minimal negations as follows:
It is important to note that these expressions are not equivalent to the 3-place minimal negation