Anthony Mistretta

Discrete Math
HW 2, Pg 34
4) Use truth tables to verify equalities.
a. pv(qvr) (pvq)vr
p
T
T
T
T
F
F
F
F

q
T
T
F
F
T
T
F
F

(pvq)
T
T
T
T
T
T
F
F

r
T
F
T
F
T
F
T
F

(pvq)vr
T
T
T
T
T
T
T
F

(qvr)
T
T
T
F
T
T
T
F

pv(qvr)
T
T
T
T
T
T
T
F

(p^q)
T
T
F
F
F
F
F
F

r
T
F
T
F
T
F
T
F

(p^q)^r
T
F
F
F
F
F
F
F

(q^r)
T
F
F
F
T
F
F
F

p^(q^r)
T
F
F
F
F
F
F
F

b. p^(q^r) (p^q)^r
p
T
T
T
T
F
F
F
F

q
T
T
F
F
T
T
F
F

8) Use deMorgans laws to negate the following: -(p ^v q) -p v^ -q

a
.

(Kwame will take a job in industry)

OR (will go to graduate school).

b
.
c
.
d
.

(Yoshiko knows Java) AND (knows

calculus).
(James is young) AND (is strong).
(Rita will move to Oregon) OR (move
to Washington).

(Kwame will NOT take a job in

industry) AND (will NOT go to
graduate school).
(Yoshiko does NOT know Java) OR
(does NOT know calculus).
(James is NOT young) OR (is NOT
strong).
(Rita will NOT move to Oregon) AND
(NOT move to Washington).

Anthony Mistretta
Discrete Math
HW 2, Pg 34
12)Prove each statement is a tautology by using equivalencies:
a.
[-p^(pvq)] -> q
[(-p^p) v (-p^q)]
-> q
[ F v (-p^q)] -> q
T v -(-p^q) v q
T
b.
[(p->q)^(q->r)] ->(p->r)
(p->q) ->(p->r) v (q->r)
->(p->r)
(-p v q) ->(-p v r) v (-q v r)
->(-p v r)
(p ^-q) v (-p v r) v (q ^ -r) v
(-p v r)
(p ^-q) v (q ^ -r) v (-p v r)
(p ^-q) v (q v (-p v r) ^ (-r v
(-p v r))
(p ^-q) v (q v (-p v r) ^ T
(p ^-q) v (q v -p v r)
(p v q v -p v r) ^ (-q v q v -p
v r)
T
^
T
T
c.
[p^(p->q)]->q
[p^(-p v q)]->q
[( p^-p) v
(p^q)]->q
[F v (p^q)]->q
(p^q)->q
(-pv-q)vq
T
d.
[(pvq) ^ (p->r) ^ (q->r)]->r
[(pvq) ^ (-pvr) ^ (-qvr)]->r
(-p ^ -q) v (p ^ -r) v [(q ^ -r) v
r]
(-p ^ -q) v (p ^ -r) v [ (q v r) ^
(-r v r)]
(-p ^ -q) v (p^-r) v [ (q v r) ^
T]

Anthony Mistretta
Discrete Math
HW 2, Pg 34
(-p ^ -q) v (p^-r) v (q v r)
[(-p ^ -q) v q] v [ (p^-r) v r)]
[(-p v q) ^ (-q v q)] v [ (p v r)
^ (-r v r)]
[(-p v q) ^ T] v [ (p v r) ^ T]
(-p v q) v (p v r)
(-p v p) v q v r
Tvqv r
T
14) Is: (-p^(p->q)) -> -q :a tautology? NO, it is a contingency.
p

-p

T
T
F
F

F
F
T
T

T
F
T
F

(p>q)
T
F
T
T

(-p^(p>q))
F
F
T
T

-q

(-p ^ (p>q))->-q
T
T
F
T

F
T
F
T

18) Show that: (p->q) (-q -> -p).

By table:
p

-q

-p

T
T
F
F

T
F
T
F

F
T
F
T

F
F
T
T

(p ->
q)
T
F
T
T

(-q ->
-p)
T
F
T
T

By rules:
p ->
q
-p v q
q v p
-q ->
-p
26) Show that: -p -> (q -> r) q -> (p v r).
By table:
p
T
T
T

T
T
F

T
F
T

p
F
F
F

(q -> r)
T
F
T

-p -> (q
-> r)
T
T
T

(p v r)
T
T
T

q -> (p v
r)
T
T
T

Anthony Mistretta
Discrete Math
HW 2, Pg 34
T
F
F
F
F

F
T
T
F
F

F
T
F
T
F

F
T
T
T
T

T
T
F
T
T

T
T
F
T
T

T
T
F
T
F

T
T
F
T
T

By rules:
-p -> (q -> r)
p v (-q v r)
-q v (p v r)
q -> (p v r)
32) Show that: (p ^ q) -> r) not (p -> r) ^ (q -> r).
By table:
p

T
T
T
T
F
F
F
F

T
T
F
F
T
T
F
F

T
F
T
F
T
F
T
F

(p ^
q)
T
T
F
F
F
F
F
F

(p ->
r)
T
F
T
F
T
T
T
T

(q ->
r)
T
F
T
T
T
F
T
T

(p ^ q)
-> r
T
F
T
T
T
T
T
T

(p -> q) ^ (q
-> r)
T
F
T
F
T
F
T
T