= Negation with one binary connective
{title2=$8\text{ adequate binary truth functions}$}
Among sixteen binary Boolean truth functions, eight become functionally complete together with <negation>. The eight affine functions cannot express <conjunction> because composition preserves affinity. Each of the other eight <truth tables> has exactly one or three true rows. Negating the output if needed and selected inputs transforms its unique true row to the <conjunction> table. Thus <conjunction> and <negation> become definable and <disjunctive normal form> expresses every <Boolean function>.
Back to article page
