Machine-translated by Google. Questions are authored in English.
Top

Discussion

If F1, F2 and F3 are propositional formulae such that F1 ^ F2 → F3 and F1 ^ F2 → ˥F3 are both tautologies, then which of the following is TRUE?

  • A.Both F1 and F2 are tautologies
  • B.The conjuction F1 ^ F2 is not satisfiable
  • C.Neither is tautologies
  • D.None of these

Answer: B

Correct answer: The conjuction F1 ^ F2 is not satisfiable

If both implications are tautologies then whenever \( F_1 \land F_2 \) is true, F3 and its negation are both true - which is impossible. So \( F_1 \land F_2 \) can never be true, and it is unsatisfiable. Nothing follows about F1 or F2 individually; each may be satisfiable on its own.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.