The statement $(p$ $\Rightarrow q) \vee (p$ $\Rightarrow r)$ is $NOT$ equivalent to:

  • A
    $(p \wedge (\sim r)) \Rightarrow q$
  • B
    $(\sim q) \Rightarrow ((\sim r) \vee p)$
  • C
    $p \Rightarrow (q \vee r)$
  • D
    $(p \wedge (\sim q)) \Rightarrow r$

Explore More

Similar Questions

If $c$ denotes the contradiction,then the dual of the compound statement $\sim p \wedge (q \vee c)$ is:

Consider the following statements:
$r: \text{If } p \to q \text{ is false, then } p \vee q \text{ is false.}$
$s: \text{If } p \leftrightarrow q \text{ is false, then } p \vee q \text{ is false.}$
The truth values of $r \to s$ and $s \to r$ are respectively:

Write the negation of the following statement:
$p:$ For every positive real number $x,$ the number $x-1$ is also positive.

The compound statement $(P \vee Q) \wedge (\sim P) \Rightarrow Q$ is equivalent to:

The statement $p$ $\rightarrow (q$ $\rightarrow p)$ is equivalent to which of the following?

Difficult
View Solution

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo