Step 1: Understand the Logical Equivalence Rules
The standard logical identity for an implication with a disjunction (OR) in its antecedent is given by:
(p∨q)⇒r≡(p⇒r)∧(q⇒r)
Step 2: Analyze Statement S1
S1:((p∨q)⇒r)⇔(p⇒r)
Let us construct a counterexample using truth values to see if this is a tautology:
- Let p=False
- Let q=True
- Let r=False
Evaluate LHS: (p∨q)⇒r
- p∨q=False∨True=True
- True⇒False=False
Evaluate RHS: p⇒r
- False⇒False=True
Since LHS=False and RHS=True, their bi-conditional equivalence (⇔) evaluates to False.
Therefore, S1 is not a tautology.
Step 3: Analyze Statement S2
S2:((p∨q)⇒r)⇔((p⇒r)∨(q⇒r))
Using our known logical identity from Step 1, the true distribution rule uses an AND (∧) operator, not an OR (∨) operator. Let us test with another counterexample:
- Let p=True
- Let q=False
- Let r=False
Evaluate LHS: (p∨q)⇒r
- p∨q=True∨False=True
- True⇒False=False
Evaluate RHS: (p⇒r)∨(q⇒r)
- p⇒r=True⇒False=False
- q⇒r=False⇒False=True
- False∨True=True
Since LHS=False and RHS=True, their bi-conditional equivalence (⇔) evaluates to False.
Therefore, S2 is also not a tautology.
Conclusion:
Neither (S1) nor (S2) is a tautology.