1.

Consider the following two well-formed formulas in prepositional logic.F1 : P ⇒ ¬ PF2 : (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»


Discussion

No Comment Found

Related InterviewSolutions