Given statement is p ➝(q ➝ p)
=p ➝ (~q v p)
[∴ By example p ➝ q =p V q]
= (~p) V (~q V p) [Again by example 12.17]
= (~p V ~q) V p [Associative law)]
= (~p V p) V ~q [Commutative law)]
= II V ~q [~p V p is also tautology]
= II [II V ~q] is also a tautology.

given A = {Q\{1}}
A is defined on A by x*y = x+y-xy
Let x,y ≠ 1
∴ x*y = x + y - xy
Now to prove that x + y - xy ≠ 1
Let us assume that x + y - xy = 1
x+y-xy-1 = 0
(x-1)-y(x-1) = 0
(x-1)(1-y) = 0
x =1 or y = 1 which is a false [∵x, y ≠ 1]
∴ is a binary operation on A.
Commutative property:
Let x,y ∈A ⇒ x, y≠1
∴x*y = x+y-xy
and y*x = y+x-yx
⇒x+y = y*x∀x, y∈A
A has commutative property under *
Associative property:
Let x,y,z ∊A ⇒x,y,z≠1
Consider (x*y)*z = (x+y-xy)*z
= x +y~xy +z- (x +y-xy)z
= x +y-xy+ z-xz- yz + xyz
= x +y+z-xy-yz-zx +xyz ...(1)
= x +y+z - yz - x (y + z - yz)
= x +y +z-yz-zy-xz +xyz ..(2)
From (1) & (2), (x*y)*z = x*(y*z)
A has associative property under *.

Given M = \(\left\{ \left( \begin{matrix} x & x \\ x & x \end{matrix} \right) :x\in R-\{ 0\} \right\} \) and * be the matrix multipilication.
Let A \(=\left( \begin{matrix} x & x \\ x & x \end{matrix} \right) \) and B = \(\left( \begin{matrix} y & y \\ y & y \end{matrix} \right) \in M\)
Where x, y ∈R-{0}.
\(A*B=\left( \begin{matrix} x & x \\ x & x \end{matrix} \right) \left( \begin{matrix} y & y \\ y & y \end{matrix} \right) \)
\(\\ =\left( \begin{matrix} 2xy & 2xy \\ 2xy & 2xy \end{matrix} \right) \in M\)
[∵ 2xy ∈R-{0}]
∴ M is closed under *.
Commutative property:
we know A*B =\(\left( \begin{matrix} 2xy & 2xy \\ 2xy & 2xy \end{matrix} \right) ..(1)\)
Let x,y∈R-{0}
Now B + A \(=\left( \begin{matrix} y & y \\ y & y \end{matrix} \right) \left( \begin{matrix} x & x \\ x & x \end{matrix} \right) \)
\(=\left( \begin{matrix} xy+xy & xy+xy \\ xy+xy & xy+xy \end{matrix} \right) \)
\(=\left( \begin{matrix} 2xy & 2xy \\ 2xy & 2xy \end{matrix} \right) \\ \)
From (1) &(2), A*B = B*A
∴ *has commutative property on M
Associative property:
Let A = \(\left( \begin{matrix} x & x \\ x & x \end{matrix} \right) \)
B =\(\left( \begin{matrix} y & y \\ y & y \end{matrix} \right) \) and
C = \(\left( \begin{matrix} z & z \\ z & z \end{matrix} \right) \)
for x, y, z ∈R-{0}
\((A*B)*C=\left( \begin{matrix} 2xy & 2xy \\ 2xy & 2xy \end{matrix} \right) *\left( \begin{matrix} z & z \\ z & z \end{matrix} \right) \)
\(=\left( \begin{matrix} 2xyz+2xyz & 2xyz+2xyz \\ 2xyz+2xyz & 2xyz+2xyz \end{matrix} \right) \)
\(=\left( \begin{matrix} 4xyz & 4xyz \\ 4xyz & 4xyz \end{matrix} \right) ...(1)\)
Now\(A*(B*C)=A*\left( \begin{matrix} 2yz & 2yz \\ 2yz & 2yz \end{matrix} \right) \)
\(=\left( \begin{matrix} x & x \\ x & x \end{matrix} \right) *\left( \begin{matrix} 2yz & 2yz \\ 2yz & 2yz \end{matrix} \right) \)
\(=\left( \begin{matrix} 4xyz & 4xyz \\ 4xyz & 4xyz \end{matrix} \right) ...(2)\\ \)
From (1)&(2), (a*B)*C = A*B*C)
Since matrix multiplication is associative, this axiom holds good for M.

∴ ((p⟶ q) ∧ (q ⟶ r)) ⟶ (p ⟶ r)
The given statement is a tautology.

It can be obtained by using examples 12.15 and 12.16 that
p↔q ≡ (¬ p ∨ q)  ∧ (¬q ∨ p) ... (1)
≡ (¬p∨q)  ∧ ( p∨ ¬q) (by Commutative Law) ... (2)
≡ (¬p ∧ ( p ∨ ¬q)) ∨ (q ∧ ( p ∨ ¬q)) (by Distributive Law)
≡ (¬p ∧ p) ∨ (¬p ∧ ¬q) ∨ (q ∧ p) ∨ (q ∧ ¬q) (by Distributive Law)
≡ F ∨ (¬p ∧ ¬q) ∨ (q ∧ p) ∨ F; (by Complement Law)
≡ (¬p ∧ ¬q) ∨ (q ∧ p) ; (by Identity Law)
≡ ( p ∧ q) ∨ (¬p ∧ ¬q) ; (by Commutative Law)
Finally (1) becomes p ↔️ q ≡ ( p ∧ q) v (ㄱp ∧ ㄱq)