Consider two well-formed formulas in propositional logic F₁: P ⇒ ¬P F₂: (P ⇒…
PYQ GATE 2001Modified — slightly modified from the official paper; see the solution
Consider two well-formed formulas in propositional logic
F₁: P ⇒ ¬P
F₂: (P ⇒ ¬P) ∨ (¬P ⇒ P)
Which one of the following statements is correct?
- A.
F₁ is satisfiable, F₂ is valid
- B.
F₁ unsatisfiable, F₂ is satisfiable
- C.
F₁ is unsatisfiable, F₂ is valid
- D.
F1 and F2 are both valid
Attempted by 181 students.
Sign up free to check your answer
Sign up freeLoading lesson…

