The negation of the statement (p vee q) wedge | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(A) Let the statement be $S = (p \vee q) \wedge (q \vee (\sim r))$.The negation of $S$ is $\sim S = \sim [(p \vee q) \wedge (q \vee (\sim r))]$.Using

Vedclass · Accepted Answer

$(\sim p \wedge \sim q) \vee (\sim q \wedge r)$

Vedclass · Answer

(A) Let the statement be $S = (p \vee q) \wedge (q \vee (\sim r))$.The negation of $S$ is $\sim S = \sim [(p \vee q) \wedge (q \vee (\sim r))]$.Using De Morgan's Law,$\sim (A \wedge B) = (\sim A) \vee (\sim B)$:$\sim S = \sim (p \vee q) \vee \sim (q \vee (\sim r))$.Applying De Morgan's Law again,$\sim (p \vee q) = (\sim p \wedge \sim q)$ and $\sim (q \vee (\sim r)) = (\sim q \wedge r)$:$\sim S = (\sim p \wedge \sim q) \vee (\sim q \wedge r)$.

The negation of the statement $(p \vee q) \wedge (q \vee (\sim r))$ is

Similar Questions

The following statement $(p \to q) \to [(\sim p \to q) \to q]$ is

The dual of the statement pattern $(p \land \sim q) \to (q \land \sim p)$ is equivalent to

The negation of the statement pattern $p \vee (q \rightarrow \sim r)$ is

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

Let $p$ and $q$ be any two logical statements and $r: p \to (\sim p \vee q)$. If $r$ has a truth value $F$,then the truth values of $p$ and $q$ are respectively

Vedclass Test Series

Exam Paper Generator

Online Exam Module