hw2solutions

# Hw2solutions - disjunctions by using NAND’s Thus every compound proposition can be converted into a logically equivalent compound proposition

This preview shows pages 1–5. Sign up to view the full content.

SOLUTIONS TO HOMEWORK #2 Total point : 80 Section 1.2: 29, 32, 52, 54 (Each sum carry 5 points) 29 . Solution is provided at the back of the textbook. 32 . We just need to find an assignment of truth values that makes one of these propositions true and the other false. We can let p be true and the other two variables false. Then the first statement will be F ՜ F, which is true, but the second will be F ٿ T, which is false. 52 . From the truth tables that, (p | p) ؠ ( p) and that [(p | p) | (q | q)] ؠ ሺ pVq). Then we can argue that every compound proposition is logically equivalent to one that uses only and V. but by our observations at the beginning of the p[resent exercise, we can get rid of all the negations and

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the 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|(q|r) and (p|q)|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|(q|r) is false and (p|q)|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.

### Page1 / 5

Hw2solutions - disjunctions by using NAND’s Thus every compound proposition can be converted into a logically equivalent compound proposition

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online