Answer:
see attached
Explanation:
The truth table technique shows the first proposition is True. However, the second proposition cannot be shown to be a tautology, because it isn't true.
__
a.
The "equals" relation is commutative: (a=b) ≡ (b=a), hence the expression ...
(p=q)∧(q=p)
is equivalent to
(p=q)∧(p=q)
We know that the And of p with itself is just p, so that fact ensures the truth of ...
(p=q)∧(p=q) = (p=q)
Hence
(p=q)∧(q=p) = (p=q)
The top truth table in the attached shows the final comparison of the two expressions is true for all values of p and q.
__
b.
The attached truth table shows that the given relation is not a tautology.