1

a)

p q r p ˅q ( p ˅q)˅ r
T T T T T
T T F T T
T F T T T
T F F T T
F T T T T
F T F T T
F F T F T
F F F F F

p q r q˅r p ˅(q ˅r )
T T T T T
T T F T T
T F T T T
T F F F T
F T T T T
F T F T T
F F T T T
F F F F F

=> ( p ˅q)˅ r ≡ p ˅(q ˅ r )

b)

p q r p ˄q ( p ˄q)˄ r
T T T T T
T T F T F
T F T F F
T F F F F
F T T F F
F T F F F
F F T F F
F F F F F
 p q r q˄r p ˄(q ˄r )
T T T T T
T T F F F
T F T F F
T F F F F
F T T T F
F T F F F
F F T F F
F F F F F

=> ( p ˄q)˄ r ≡ p ˄(q ˄ r )

a) [¬ p ˄( p ˅ q)]→q

This is a implication so it always true if q ≡T , then assume that q ≡ F :

¬ p ˄( p ˅q) ≡(¬ p ˄ p)˅(¬ p ˄ q) by distributive laws

¬ p ˄( p ˅q) ≡ F ˅(¬ p ˄ F)by negation laws∧q ≡ F
¬ p ˄( p ˅q) ≡ F ˅ F by domination laws
¬ p ˄ ( p ˅ q) ≡ F

=> [ ¬ p ˄ ( p ˅ q ) ] → q ≡T

b)

p ˄ ( p → q ) →q ≡ p ˄ ( ¬ p ˅ q ) →q by truth table for →

p ˄ ( p → q ) →q ≡ ( p ˄¬ p ) ˅ ( p ˄ q ) → q by distributive laws
p ˄ ( p → q ) →q ≡ F ˅ ( p ˄ q ) → q by negationlaws
p ˄ ( p → q ) →q ≡ ( p ˄q ) → q by identity laws
p ˄ ( p → q ) →q ≡¬ ( p ˄ q ) ˅q by truth table for →
p ˄ ( p → q ) →q ≡¬ p ˅¬ q ˅ q by de morgans laws
p ˄ ( p → q ) →q ≡¬ p ˅T by negation laws
p ˄ ( p → q ) →q ≡T by domination laws
3

p ˄q ˄ ¬r

a) There is a student in your school has visited North Dakota.

b) All student in your school has visited North Dakota.

c) It is not the case that some student in your school has visited North Dakota.

d) There is a student hasn’t visited North Dakota.

e) Not all student in your school has visited North Dakota.

f) All student in your school hasn’t visited North Dakota.

a) True

b) True

c) False

d) True

e) False

f) True

g) False

a) x = 1, 12 = 1

b) x = √ 2, ¿)2 = 2

c) x = 0, |0| = 0