Consider:
S1: is a tautology.
S2: is a contradiction.
Then
We need to check whether S1 is a tautology and S2 is a contradiction.
. Actually, let us parse with standard precedence. binds tighter than , and has the lowest precedence. So the expression is:
Let us evaluate using a truth table approach. When , the right-hand side is , so ; when , the right-hand side is , so ; when , a false premise implies anything giving ; and when , again a false premise implies anything giving .
S1 is TRUE for all truth values, so S1 is a tautology. Statement S1 is correct.
, which parses as .
When (so ), a false premise implies anything, giving ; when (so ), the right-hand side is , so ; when (so ), the right-hand side is , so .
S2 is TRUE for all truth values, so S2 is also a tautology and not a contradiction, so the claim that S2 is a contradiction is wrong. Therefore, S1 is correct (it is a tautology), but S2 is incorrect (it is actually a tautology rather than a contradiction), and the correct answer is Option 4, for which only S1 is correct.
Tagged Logical connectives, truth tables and tautologies. Machine-assigned, so read it as a strong shortlist rather than a verdict.