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?

  1. A.

    F₁ is satisfiable, F₂ is valid

  2. B.

    F₁ unsatisfiable, F₂ is satisfiable

  3. C.

    F₁ is unsatisfiable, F₂ is valid

  4. D.

    F1 and F2 are both valid

Attempted by 181 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…