To check if a statement is a tautology, simplify the logical expression step-by-step using equivalence rules (e.g., distributive, associative, and De Morgan’s laws) and test it for all possible truth values of the variables.
\(p \vee( p \wedge q )\)
\(( p \wedge( p \rightarrow q )) \rightarrow \sim q\)
\(( p \wedge q ) \rightarrow(\sim( p ) \rightarrow q )\)
\(p \rightarrow( p \wedge( p \rightarrow q ))\)
To determine which statement is a tautology, we need to analyze each of the given logical expressions. A tautology is a statement that is true in every possible interpretation. Let's evaluate each option:
After evaluating all options, we conclude that the correct tautology is \(( p \wedge q ) \rightarrow(\sim( p ) \rightarrow 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 ))\)