Let $p, q, r$ denote arbitrary statements. Then the logical equivalent of the statement $p \Rightarrow (q \vee r)$ is

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

Explore More

Similar Questions

The simplest form of the following switching circuit is represented by which of the given options?

Write the negation of the following statement and check whether the resulting statement is true:
Every natural number is greater than $0.$

The statement $\sim(p \leftrightarrow \sim q)$ is

$(S1) (p \Rightarrow q) \vee (p \wedge (\sim q))$ is a tautology. $(S2) ((\sim p) \Rightarrow (\sim q)) \wedge ((\sim p) \vee q)$ is a contradiction. Then

Write the contrapositive of the following statement:
If a number is divisible by $9,$ then it is divisible by $3.$

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