If $p, q, r$ are simple propositions with truth values $T, F, T$, then the truth value of $(\sim p \vee q)\; \wedge \sim r \Rightarrow p$ is
If $p, q, r$ are simple propositions with truth values $T, F, T$, then the truth value of $(\sim p \vee q)\; \wedge \sim r \Rightarrow p$ is
- A
true
- B
false
- C
True if $r$ is false
- D
True if $q$ is true
Similar Questions
Which of the following is the negation of the statement "for all $M\,>\,0$, there exists $x \in S$ such that $\mathrm{x} \geq \mathrm{M}^{\prime \prime} ?$
Which of the following is the negation of the statement "for all $M\,>\,0$, there exists $x \in S$ such that $\mathrm{x} \geq \mathrm{M}^{\prime \prime} ?$
- [JEE MAIN 2021]
Negation of the compound proposition : If the examination is difficult, then I shall pass if I study hard
Negation of the compound proposition : If the examination is difficult, then I shall pass if I study hard
The negation of the Boolean expression $x \leftrightarrow \sim y$ is equivalent to
The negation of the Boolean expression $x \leftrightarrow \sim y$ is equivalent to
- [JEE MAIN 2020]
If $(p\; \wedge \sim r) \Rightarrow (q \vee r)$ is false and $q$ and $r$ are both false, then $p$ is
If $(p\; \wedge \sim r) \Rightarrow (q \vee r)$ is false and $q$ and $r$ are both false, then $p$ is
The negation of $ \sim s \vee \left( { \sim r \wedge s} \right)$ is equivalent to
The negation of $ \sim s \vee \left( { \sim r \wedge s} \right)$ is equivalent to