Expression ∼ ( ∼ p, to ,q) is logically equivalent to

English

Gujarati

Hindi

Mathematical Reasoning

hard

The expression $ \sim ( \sim p\, \to \,q)$ is logically equivalent to

A

$ \sim p\, \wedge \sim \,q$

B

$ p\, \wedge \sim \,q$

C

$ \sim p\, \wedge \,\,q$

D

$p\, \wedge \,\,q$

(JEE MAIN-2019)

Solution

$p$	$q$	${ \sim p}$	$ \sim p \to q$	$ \sim \left( { \sim p \to q} \right)$	$\left( { \sim p \wedge \sim q} \right)$
$T$	$T$	$F$	$T$	$F$	$F$
$F$	$T$	$T$	$T$	$F$	$F$
$T$	$F$	$F$	$T$	$F$	$F$
$F$	$F$	$T$	$F$	$T$	$T$

Standard 11

Mathematics

Share

Similar Questions

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

hard

(JEE MAIN-2023)

The negation of the expression $q \vee((\sim q) \wedge p)$ is equivalent to

hard

(JEE MAIN-2023)

Consider the following three statements :
$P : 5$ is a prime number.
$Q : 7$ is a factor of $192$.
$R : L.C.M.$ of $5$ and $7$ is $35$.
Then the truth value of which one of the following statements is true?

hard

(JEE MAIN-2019)

$(p\rightarrow q) \leftrightarrow (q \vee ~ p)$ is

normal

$\left( { \sim \left( {p \vee q} \right)} \right) \vee \left( { \sim p \wedge q} \right)$ is logically equivalent to

normal