We begin with the symbolic sentence
p⊕q∧∼p⊙q
The tilde ∼ (negation) always has the highest precedence.
Among the binary connectives we remember the usual rule “AND binds more
strongly than OR”.
Therefore the fixed connective ∧ (which is written explicitly in the
statement) is evaluated before whichever symbol will finally be placed in
⊕.
In the same way, the symbol ⊙ will first be replaced by either
∧ or ∨ and then be evaluated inside the parentheses that we
shall introduce for clarity.
So, whatever the final choice of ⊕ and ⊙ is, the expression
can be read as
p⊕(q∧(∼p⊙q)).
We are told that, after the two replacements are made, the above statement
must be identically equal to the simple conjunction p∧q.
There are only four possible ordered pairs
(⊕,⊙)=(∨,∧),(∧,∧),(∨,∨),(∧,∨).
We shall substitute each pair one by one, simplify by ordinary Boolean
algebra, and see which pair really gives p∧q.
1. (⊕,⊙)=(∨,∧)
p∨(q∧(∼p∧q))=p∨(q∧∼p∧q)=p∨(q∧q∧∼p)=p∨(q∧∼p)=(p∨q)∧(p∨∼p)[distributive law]=p∨q.
This is p∨q, not p∧q, so the first pair fails.
2. (⊕,⊙)=(∧,∧)
p∧(q∧(∼p∧q))=p∧q∧∼p∧q=p∧∼p∧q=False.
This is the zero (contradiction) function, not p∧q, so the second
pair is also rejected.
3. (⊕,⊙)=(∨,∨)
p∨(q∧(∼p∨q))=p∨((q∧∼p)∨(q∧q))=p∨((q∧∼p)∨q)=p∨q.
Again the result is p∨q=p∧q, so the third pair does not
work either.
4. (⊕,⊙)=(∧,∨)
p∧(q∧(∼p∨q))∴p∧(q∧(∼p∨q))=p∧(q∧[(∼p∨q)])Use the distributive law inside the square brackets:q∧(∼p∨q)=(q∧∼p)∨(q∧q)=(q∧∼p)∨q=q∨(q∧∼p)=q.=p∧q.
This time the simplified form is exactly p∧q, the target
expression.
Hence only the ordered pair (∧,∨) satisfies the
requirement.
Therefore the Boolean sentence is equivalent to p∧q only when
(⊕,⊙)=(∧,∨).
Hence, the correct answer is Option 4.