Solution:
We will solve this problem using two different approaches.
Approach 1 - Using Truth Table:
Using truth table. This would involve creating the truth tables for the given options, till you come across a case which is a tautology.
Here, for the sake of brevity, we will show the truth table just for the correct option, which is $[A \land (A \rightarrow B)] \rightarrow B$
$A$ | $B$ | $A \rightarrow B$ | $A \land (A \rightarrow B)$ | $[A \land (A \rightarrow B)] \rightarrow B$ |
$0$ | $0$ | $1$ | $0$ | $1$ |
$0$ | $1$ | $1$ | $0$ | $1$ |
$1$ | $0$ | $0$ | $0$ | $1$ |
$1$ | $1$ | $1$ | $1$ | $1$ |
-----------book page break-----------
Since for all input combinations for this expression evaluates to $1$, this is a tautology.
If you evaluate all the other options, for each you will find at least one set of input for which the expression evaluates to $0$
Approach 2 - Using Logical Deduction:
Here we will see the logical approach to solve this problem. For each of the given options we will try to find a set of input, which will lead to a $0$ value of expression. Not finding such a value will show that the given option is a tautology.
$A \land (A \lor B) = 0$
We can see that $A = 0$ will lead to the whole expression being $0$, no matter what the value of $B$ is.
Therefore, this is not a tautology.
$A \lor (A \land B)$
Here,
$A = 0$
Therefore, $A \land B = 0$ no matter what the value of $B$ is. Therefore, this is not a tautology.
$B \rightarrow [A \land (A \rightarrow B)]$
This expression will yield a result of $0$ only if $B = 1$ and $A \land (A \rightarrow B) = 0$
If $A \land (A \rightarrow B) = 0$ then one of the possible values of $A$ is $0$
Putting $A = 0$ and $B = 1$, we get:
$B \rightarrow [A \land (A \rightarrow B)]$
$= 1 \rightarrow [0 \land (0 \rightarrow 1)]$
$= 1 \rightarrow [0 \land 1]$
$= 1 \rightarrow 0$
$= 0$
Since we have a $0$ value of the expression, this cannot be a tautology.
-----------book page break-----------
$[A \land (A \rightarrow B)] \rightarrow B$
For this expression to be $0$, the only possible condition is $[A \land (A \rightarrow B)] = 1$ and $B = 0$
If $[A \land (A \rightarrow B)] = 1$, then $A = 1$
Putting $A = 1$ and $B = 0$, we get:
$[A \land (A \rightarrow B)] \rightarrow B$
$= [1 \land (1 \rightarrow 0)] \rightarrow 0$
$= [1 \land 0] \rightarrow 0$
$= 0 \rightarrow 0$
$= 1$
Therefore, there is no input set which will lead to a result of $0$ for the expression, hence, this is a tautology.
It may appear that the second method is longer than the first method, however, given that we have evaluated only one option in the first approach, and all the four options in the second approach, the second approach is much more efficient.