Idempotent laws p∨p≡p p∧p≡p

Associative laws (p ∨ q) ∨ r ≡ p ∨ (q ∨ r) (p ∧ q) ∧ r ≡ p ∧ (q ∧ r)
Commutative laws p∨q ≡q∨p p∧q ≡q∧p
Distributive laws p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r) p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)
Identity laws p∨F ≡p p∨T ≡T p∧F ≡F p∧T ≡p
Involution laws ¬¬p ≡ p
Complement laws ¬p ∨ p ≡ T ¬p ∧ p ≡ F
DeMorgan’s laws ¬(p ∧ q) ≡ ¬p ∨ ¬q ¬(p ∨ q) ≡ ¬p ∧ ¬q
Conditional identities p → q ≡ ¬p ∨ q p ↔ q ≡ (p → q) ∧ (q → p)

1. (4 points) In each question below, two propositions are given which are logically equivalent. Give the
name of the law that can be used to show that the two propositions are logically equivalent.

¬((w ∨ p) ∧ (¬q ∧ ¬w)) (¬p ∧ (r ∨ ¬q)) ∨ (¬p ∧ w)

(a) (b)
¬(w ∨ p) ∨ ¬(¬q ∧ ¬w) ¬p ∧ ((r ∨ ¬q) ∨ w)

r ∧ (p ∨ q) (r ∧ p) ∨ (¬p ∧ q)
(c) (d)
r ∧ (q ∨ p) ((r ∧ p) ∨ ¬p) ∧ ((r ∧ p) ∨ q)

2. (4 points) Fill in the steps of the argument below to show that ¬(¬p ∧ q) ∧ (p ∨ q) ≡ p. Each step
is labeled with the name of a propositional law. Fill in each blank with a proposition so that each
proposition can be obtained from the one before it by applying the stated law.

¬(¬p ∧ q) ∧ (p ∨ q) Start

De Morgan’s Law

Double Negation Law

Distributive Law

Complement Law

p Identity Law

3. (6 points) Suppose that the propostitional variables p, q, and r have the following truth values:

p=T q=T r = F.

Circle the logical expressions that evaluate to true:

(a) p ∨ q (c) r → q (e) (q ∧ ¬r) → ¬p

(b) q ∧ ¬r (d) p ↔ (q ∧ r) (f) ¬(p ∨ q ∨ r)
 2

4. (3 points) Show that (p ↔ ¬q) → ¬p is not a tautology. If you use a truth table, you need to be
specific about which row of the truth table justifies your answer.

5. (8 points) Define the propositional variable:

• b: Joe has maintained a B average.

• c: Joe has received below a C in a class.
• h: Joe is eligible for the honors program.

Translate the following sentences into logical propositions. For example the statement: ”If Joe has
maintained an B average, then he is eligible for the honors program” would be translated as b → h.

(a) Maintaining a B average is sufficient for Joe to be eligible for the honors program.

(b) Joe is eligible for the honors program, only if he has maintained a B average.

(c) Joe has maintained a B average even though he did receive a grade below a C in a class.

(d) Joe is eligible for the honors program if and only if he has maintained a B average and has not
received below a C in a class.

6. (3 points) Consider the conditional statement:

”If Joe maintained a B average, then he is eligible for the honors program.”

Label each statement below according to whether it is the contrapositive, converse or inverse of the
statement above.

(a) If Joe is not eligible for the honors program then he did not maintain a B average.

(b) If Joe is eligible for the honors program, then he maintained a B average.

(c) If Joe did not maintain a B average, then he is not eligible for the honors program.
 3

7. (12 points) A student club holds a meeting. The predicate M (x) denotes whether person x came to
the meeting on time. The predicate O(x) refers to whether person x is an officer of the club. The
predicate D(x) indicates whether person x has paid his or her club dues. The domain is the set of all
members of the club. Give a logical expression that is equivalent to each English statement below.

(a) Someone is not an officer.

(b) All the officers came on time to the meeting.

(c) Everyone was on time for the meeting.

(d) Everyone paid their dues or came on time to the meeting.

(e) At least one person paid their dues and came on time to the meeting.

(f) There is an officer who did not come on time for the meeting.

8. (10 points) This question refers to the same club and predicates in the previous question. Suppose that
the club has five members. The names of the members and their truth values for each of the predicates
is given in the table below. Circle the expressions that are true for this particular club. If a universal
statement is not true, give a counter-example. If an existential statement is true, give an example.

Name M (x) O(x) D(x)

Hillary T F T
Bernie F T F
Donald F T F
Jeb F T T
Carly F T F

(a) ∀x ¬(O(x) ↔ D(x)) (f) ∀x ¬D(x)

(b) ∀x((x 6= Jeb) → ¬(O(x) ↔ D(x)) (g) M (Jeb) ∧ D(Hillary)

(c) ∀x(¬O(x) → D(x)) (h) D(Bernie) → O(Bernie)

(d) ∃x(M (x) ∧ D(x)) (i) ∃x(O(x) → M (x))

(e) ∀x(M (x) ∨ O(x) ∨ D(x)) (j) ∃x(M (x) ∧ O(x) ∧ D(x))