If F₁, F₂ and F₃ are propositional formulae such that F₁ ∧ F₂ → F₃ and F₁ ∧ F₁…
GATE · 1991 · CS · Question 3 subparts
If F₁, F₂ and F₃ are propositional formulae such that F₁ ∧ F₂ → F₃ and F₁ ∧ F₁ → ¬F₂ are both tautologies, then which of the following is true:
- A.
Both F₁ and F₂ are tautologies
- B.
The conjunction F₁ ∧ F₂ is not satisfiable
- C.
Neither is tautologous
- D.
Neither is satisfiable
- E.
None of the above
Attempted by 19 students.
Sign up free to check your answer
Sign up freeLoading lesson…