To solve the given logical equivalence problem, we need to analyze the expression:
\((p \land r) \Leftrightarrow (p \land (\sim q))\).
This expression states that the conjunction of \(p\) and \(r\) is logically equivalent to the conjunction of \(p\) and not \(q\). We need to determine the condition of \(r\) that makes this equivalence equivalent to \(\sim p\).
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 ))\)