Computer Science Division Level 4- Autumn semester

Department of Mathematics Course: COMP 401

Faculty of Science November 2022

Sheet 2
Propositional Logic

1. Consider a vocabulary with only four propositions: A, B, C, and D. How many (true)
models are there for the following sentences?
a. ( A  B )  (C  D )
b. A  B
c. A  B  C

2. Use a truth table to show that {P ⟹ Q,(R ⟹ P∨Q),R} ⊨ Q

3. Show that the formula (A ⟹ B)⇔(¬B ⟹¬A) is valid.

4. Which of the following are correct?

a. False ⊨True
b. True ⊨ False
c. (A∧B) ⊨ (A ⇔ B)
d. (A ⇔ B) ⊨A∨B
e. (A ⇔ B) ⊨ ¬A∨B
f. (A∧B) ⟹ C ⊨ (A ⟹ C)∨(B ⟹ C)
g. (A ∨ B) ∧ (¬C ∨¬D ∨ E) ⊨ (A ∨ B).
h. (A ∨B) ∧¬ ( A ⟹ B) is satisfiable
i. (A ⇔ B) ∧ (¬A ∨ B) is satisfiable

5. Convert the following to CNF notation:

1. C ∧F ⟹¬B
2. ¬B ⟹ (C ∧D∧E)
3. (A∨B) ⇔ (C ∧D)
6. Use resolution to prove the sentence ¬A ∧ ¬B from the following clauses:
S1: A ⇔ (B V E)
S2: E ⇒ D
S3: C ∧ F ⇒ ¬B
S4: E ⇒ B
S5: B ⇒ F
S6: B ⇒ C
7. Consider the following sentence:
[(Food ⇒ Party) ∨ (Drinks ⇒ Party)] ⇒ [(Food ∧ Drinks) ⇒ Party].
a. Determine, using enumeration, whether this sentence is valid, satisfiable (but not
valid), or unsatisfiable.
b. Convert the left-hand and right-hand sides of the main implication into CNF,
showing each step, and explain how the results confirm your answer to (a).
c. Prove your answer to (a) using resolution.

8. Decide whether each of the following sentences is valid, unsatisfiable, or neither. Verify
your decisions using truth tables or the equivalence rules.
a. Smoke ⇒ Smoke
b. Smoke ⇒ Fire
c. (Smoke ⇒ Fire) ⇒ (￢Smoke ⇒ ￢Fire)
d. Smoke ∨ Fire ∨ ￢Fire
e. ((Smoke ∧ Heat) ⇒ Fire) ⇔ ((Smoke ⇒ Fire) ∨ (Heat ⇒ Fire))