# Binary Connections

Not what you're looking for?

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.

##### Purchase this Solution

##### Solution Summary

The expert examines single binary connectives.

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

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

##### Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

##### Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

##### Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

##### Probability Quiz

Some questions on probability