To solve this problem, we need to find the negation of the logical expression \sim p \wedge ( p \vee q ).
The expression can be broken down into:
To find the negation of this expression, we apply De Morgan's laws. De Morgan’s laws state:
Applying these laws to our expression:
Therefore, the negation of \sim p \wedge (p \vee q) is p \vee \sim q, which is option 2.
This explanation validates that the correct answer is p \vee \sim q.
The number of values of $r \in\{p, q, \sim p, \sim q\}$ for which $((p \wedge q) \Rightarrow(r \vee q)) \wedge((p \wedge r) \Rightarrow q)$ is a tautology, is :
Among the statements :
\((S1)\) \((( p \vee q ) \Rightarrow r ) \Leftrightarrow( p \Rightarrow r )\)
\((S2)\)\((( p \vee q ) \Rightarrow r ) \Leftrightarrow(( p \Rightarrow r ) \vee( q \Rightarrow r ))\)