Consider two well-formed formulas in propositional logic. F1: P ⇒ ¬P F2: (P ⇒…
GATE · Computer Science · 2001
Consider two well-formed formulas in propositional logic.
F1: P ⇒ ¬P
F2: (P ⇒ ¬P) ∨ (¬P ⇒ P)
Which of the following statements is correct?
- A.
F1 unsatisfiable, F2 is satisfiable
- B.
F1 and F2 are both satisfiable
- C.
F1 is unsatisfiable, F2 is valid
- D.
F1 is satisfiable, F2 is valid
Attempted by 169 students.
Sign up free to check your answer
Sign up freeLoading lesson…