Consider the propositional logic formula r → ¬(¬p → s) From the options below, which one is the equivalent CNF? To determine the correct answer, transform the formula above into CNF using the steps learnt in this module. (¬r ˅ ¬p) ˄ (¬r ˅ ¬s) (r ˅ p) ˄ (r ˅ s) ¬r ˅ ¬(p ˅ s) r ˅ (¬p ˄ ¬s)
4. Consider the propositional logic formula
r → ¬(¬p → s)
From the options below, which one is the equivalent CNF? To determine the correct answer, transform the formula above into CNF using the steps learnt in this module.
(¬r ˅ ¬p) ˄ (¬r ˅ ¬s)
(r ˅ p) ˄ (r ˅ s)
¬r ˅ ¬(p ˅ s)
r ˅ (¬p ˄ ¬s)
5. Which of the following are correct statements? Select all that apply.
The resolvent of p and ¬p is ∅.
Let C1, C2 be clauses. The set of clauses {C1, C2, T} and {C1, C2} are logically equivalent.
The empty set of clauses is unsatisfiable.
A set of clauses is valid if and only if every clause in the set is true in every interpretation
6. Which formulas are in 3CNF? Select all that apply.
p
(¬p ˅ q ˅ ¬r) ˄ (p ˅ ¬q ˅ r)
p ˄ q ˄ r
(¬p) ˄ (¬q ˅ r)
Step by step
Solved in 2 steps
