Mathematics Homework Solutions
Problem
#32375

Binary Connectives 17

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.

Solution
What is this?
By OTA - Overall OTA Rating
Departed OTA
Purchase Cost Now
$2.19 CAD (was ~$3.99)
Included in Download
  • Plain text response
  • Attached file(s):
    • a.doc
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • Identify the type of statement using the hierarchy of connectives. - Identify the type of statement using the hierarchy of connectives. ∼ p ⋀ q → q ⋁ r
  • Predicates, Logical Connectives and Quantifiers - Let P(x), Q(x) and R(x) be statements "x is a clear explanation", "x is satisfactory" and "x is an excuse" respectively. Suppose that the universe of discourse for x consists of all English test. Expr ...
  • Logical Connectives - College level proof before real analysis. Please give formal proof. Please explain each step of your solution. Thank you.
  • Euler Circles - Truth tables are related to Euler circles. Arguments in the form of Euler circles can be translated into statements using the basic connectives and the negation as follows: Let p be "The object belon ...
  • NOR and NAND connectives proof - ""PROVE that there are no other single binary connectives than NAND and NOR who are functionally complete"" I saw the same question on the library, but I didn't understand anything. The profess ...
Browse