This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: disjunctions by using NAND’s. Thus every compound proposition can be converted into a logically equivalent compound proposition involving only NAND’s. 54 . To show that these are not logically equivalent, we need to fing only one assignment of thruth values to p, q, and r for which the truth values of p(qr) and (pq)r differ. One such assignment is T for p and F for q and r. then computing from the truth tables (of definitions), we see thet p(qr) is false and (pq)r is true. Section 1.3: 10, 40, 56, 62 (Each sum carry 5 points) Section 1.4: 26, 28, 30, 40 (Each sum carry 5 points) Section 1.5: 4, 12, 14, 30 (Each sum carry 5 points)...
View
Full
Document
This document was uploaded on 10/16/2010.
 Spring '09

Click to edit the document details