Skip to content
Related Articles

Related Articles

UGC-NET | UGC-NET CS 2017 Nov – III | Question 59
  • Last Updated : 21 Mar, 2018

Consider the following two well-formed formulas in prepositional logic.

F1 : P ⇒ ¬ P
F2 : (P ⇒ ¬ P) ∨ (¬ P ⇒ P)

Which of the following statements is correct?
(A) F1 is Satisfiable, F2 is valid
(B) F1 is unsatisfiable, F2 is Satisfiable
(C) F1 is unsatisfiable, F2 is valid
(D) F1 and F2 both are Satisfiable


Answer: (A)

Explanation: F1:
P → ¬P
= ¬P(¬P) + P¬(¬P)
= ¬P + P is satisfiable.
F2:
(P ⇒ ¬ P) ∨ (¬ P ⇒ P)
= (¬P(¬P) + P¬(¬P)) v (P¬(¬P) + ¬P(¬P) )
= satisfiable v satisfiable
is satisfiable.
So, option (A) is correct.


Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :