The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+15 votes

Let $P, Q$ and $R$ be three atomic propositional assertions. Let $X$ denote $( P ∨ Q ) → R$ and Y denote $(P → R) ∨ (Q → R).$ Which one of the following is a tautology?

  1. $X ≡ Y$
  2. $X → Y$
  3. $Y → X$
  4. $¬Y → X$
asked in Mathematical Logic by Boss (18.3k points)
edited by | 1.3k views

1 Answer

+24 votes
Best answer
$X \equiv (P \vee Q) → R$
$\quad \equiv \neg(P \vee Q) \vee R$
$\quad \equiv (\neg P \wedge \neg Q) \vee R$
$\quad \equiv (\neg P \vee R) \wedge (\neg Q \vee R)$
$\quad \equiv (P →  R) \wedge (Q → R)$

So, $X  → Y$ is true as $(A \wedge B) → (A \vee B)$ is always TRUE but reverse implication is not always true.

Hence, B.
answered by Veteran (367k points)
edited by
Good Explanations sir
When in confusion, better to use truth table, surely to give correct answer
how to find out if reverse implication is not true? nevermind I understood

A→B is implication and B→ A is the reverse implication, in the same way, u can check that...

why option A is wrong ?


$X\equiv\lnot(P∨Q)\vee R$

$X\equiv (\lnot P \wedge \lnot Q)\vee R$

$X\equiv \bar{P}.\bar{Q}+R$


$Y\equiv(\lnot P\vee R)∨(\lnot Q\vee R)$



How $X \equiv Y$ gives always true?

It is not possible to $X \equiv Y$ gives always true(Tautology).


Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

44,150 questions
49,639 answers
65,808 users