\((P ∧ (P \to Q)) \to Q\)
\(P ∨ (P ∧ Q)\)
\(Q \to (P ∧ (P \to Q))\)
\(P ∧ (P ∨ Q)\)
To determine which of the given logical propositions is a tautology, we need to evaluate each option. A tautology is a statement that is always true, regardless of the truth values of its individual components. Let's analyze each option:
After evaluating all options, the expression \((P ∧ (P \to Q)) \to Q\) is the only one that is always true, making it the tautology among the given options.
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 ))\)