# Binary Connections

Not what you're looking for? Search our solutions OR ask your own Custom question.

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.

Â© BrainMass Inc. brainmass.com December 24, 2021, 5:10 pm ad1c9bdddfhttps://brainmass.com/math/discrete-math/binary-connectives-32375

#### Solution Preview

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 ...

#### Solution Summary

The expert examines single binary connectives.

$2.49