Talk:Functionally Complete Logical Connectives

Proof is not done
Here is the first sentence in the proof: "It suffices to consider binary operators." Why? How do we know that there is not some 342-place boolean function that cannot be created by composing the 16 binary boolean functions? Even if the proof is obvious (I don't know it, by the way), it should be included here or on another page. JamesMazur2 (talk) 12:33, 3 June 2011 (CDT)
 * Good call.--prime mover 15:11, 3 June 2011 (CDT)