# Homework 1

```Homework 1
due: January, 24, 2013
1)
2)
3)
4)
5)
6)
7)
8)
9)
10)
11)
12)
13)
14)
15)
16)
17)
18)
19)
20)
21)
Table of equivalences
p∧q
q∧p
p∨q
q∨p
&not;(&not;p)
p
(p ∨ q) ∧ r
(p ∧ r) ∨ (q ∧ r)
(p ∧ q) ∨ r
(p ∨ r) ∧ (q ∨ r)
(p ∨ q) ∨ r
p ∨ (q ∨ r)
(p ∧ q) ∧ r
p ∧ (q ∧ r)
p⇒q
&not;p ∨ q
p⇔q
(p ⇒ q) ∧ (q ⇒ p)
&not;(p ∧ q)
&not;p ∨ &not;q
&not;(p ∨ q)
&not;p ∧ &not;q
p∧T
p
p∨F
p
p∧F
F
p∨T
T
p∧p
p
p∨p
p
p ∨ &not;p
T
p ∧ &not;p
F
p ∨ (p ∧ q)
p
p ∧ (p ∨ q)
p
Problems marked with ∗ will be graded. Please practice on the rest of them to the extent you find
useful.
1. ∗ Construct truth table for &not;p ∧ &not;q, as well as for &not;(p ∨ q). Are those statements equivalent?
2. Construct truth table for &not;p ∨ &not;q, as well as for &not;(p ∧ q). Are those statements equivalent?
3. ∗ Construct truth table for (p ∨ q) ∧ r and for (p ∧ r) ∨ (q ∧ r). Are those statements equivalent?
There are three variables here, so your table should have 8 rows.
4. Construct truth table for (p ∧ q) ∨ r and for (p ∨ r) ∧ (q ∨ r). Are those statements equivalent?
There are three variables here, so your table should have 8 rows.
5. ∗ Using the table of equivalences, prove that p ∨ q is equivalent to &not;p ⇒ q, and that it is also
equivalent to &not;q ⇒ p
6. ∗ Using the table of equivalences, prove that (p ⇒ r) ∨ (q ⇒ r) is equivalent to (p ∧ q) ⇒ r
7. Using the table of equivalences, prove that (p ⇒ q) ∨ (p ⇒ r) is equivalent to p ⇒ (q ∨ r)
8. In the problems below, determine if the two statements are equivalent. If they are, prove it using
the table of equivalences, if they are not, find a counterexample.
(a) ∗ p ⇔ q and (p ∧ q) ∨ (&not;p ∧ &not;q)
(b) ∗ (p ⇒ q) ⇒ r and p ⇒ (q ⇒ r)
(c) &not;(p ⇔ q) and p ⇔ &not;q
(d) &not;p ∧ &not;(p ∨ q) and &not;p ∨ q
1
Remarks:
• If the task is to construct a truth table, only the final product, the table, will be graded. Your
scratch calculations, to figure out whether the entry should be T or F , does not have to be in your