Nov2017 cs Q59

0. Consider the following two well-formed formulas in prepositional logic.
F₁ : P ⇒ ¬ P
F₂ : (P ⇒ ¬ P) ∨ (¬ P ⇒ P)
Which of the following statements is correct?

Answer
Comment
Array

Option : A
Explanation :
F₁: P → ¬P = ¬P(¬P) + P¬(¬P) = ¬P + P is satisfiable.
F₂: (P ⇒ ¬ P) ∨ (¬ P ⇒ P) = (¬P(¬P) + P¬(¬P)) v (P¬(¬P) + ¬P(¬P) ) = satisfiable v satisfiable is satisfiable.
So, option (A) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.