We have to select the two connectives ∗ and □ from the set {∧,∨} in such a way that the statement
(p∗∼q)⇒(p□q)
is a tautology, that is, it must be true for every possible truth-value assignment of the propositional variables p and q.
First recall the standard equivalence that rewrites an implication:
a⇒b≡¬a∨b.
Applying this formula to our expression we obtain
(p∗∼q)⇒(p□q)≡¬(p∗∼q)∨(p□q).
Because ∗ and □ may each be either ∧ (AND) or ∨ (OR), four distinct combinations are possible. We test them one by one, showing every algebraic step.
Case 1: ∗=∧,□=∨
Substituting these symbols gives
¬(p∧∼q)∨(p∨q).
We now push the negation inside the parenthesis with De Morgan’s law:
¬(p∧∼q)≡(¬p)∨(¬∼q)=(¬p)∨q.
Therefore the whole expression becomes
((¬p)∨q)∨(p∨q).
Using associativity and commutativity of ∨ we group the disjuncts that involve p:
((¬p)∨p)∨q.
Since a proposition OR its negation is always true, we have
(¬p)∨p=T(a tautology).
Thus the entire expression simplifies to
T∨q=T.
So for ∗=∧,□=∨ the implication is always true; hence this choice makes the given statement a tautology.
Case 2: ∗=∧,□=∧
The expression now is
¬(p∧∼q)∨(p∧q)=(¬p∨q)∨(p∧q).
To check whether this is a tautology, take the assignment p=T,q=F (i.e. p=1,q=0).
Then we get
¬p=0,q=0,p∧q=1∧0=0.
So the whole disjunction becomes 0∨0=0, which is false. Hence this case fails to be a tautology.
Case 3: ∗=∨,□=∨
We have
¬(p∨∼q)∨(p∨q).
Again by De Morgan,
¬(p∨∼q)=(¬p)∧q.
Hence the whole statement is
((¬p)∧q)∨(p∨q).
Choose p=F,q=F. Then
(¬p)∧q=1∧0=0,p∨q=0∨0=0,
so the overall value is 0∨0=0—not a tautology.
Case 4: ∗=∨,□=∧
The expression becomes
¬(p∨∼q)∨(p∧q)=((¬p)∧q)∨(p∧q).
With the assignment p=F,q=F we get
(¬p)∧q=1∧0=0,p∧q=0∧0=0,
so the disjunction is again 0∨0=0. Hence this case also fails to be a tautology.
Among all four possibilities, only Case 1—namely ∗=∧ and □=∨—produces a statement that is true under every possible truth assignment. All other choices admit at least one counter-example, so they are not tautologies.
Hence, the correct answer is Option C.