Show that there are no complete single binary connectives other than NAND and NOR. Hint: Let f be the truth function for a complete binary connective. Show that f(true,true)=false and f(false,false)=true because the negation operation must be represented in terms of f. Then consider the remaining cases in the truth table for f.