index § proof // not-all-equal/3 is functionally complete

not-all-equal/3

not-all-equal/3 {0,1}n → {0,1} examples of 0, 1, 2 -ary functions there are many ways of characterizing n-ary boolean functions: one being to specify for every combination of n values a0 the output f(a0, a1) the truth table structure

functional completeness