∴p v (q Λ r) is a contingency

Given \(A=\left( \begin{matrix} 1 & 0 \\ 0 & 1 \\ 1 & 0 \end{matrix}\begin{matrix} 1 & 0 \\ 0 & 1 \\ 0 & 1 \end{matrix} \right) ,B=\left( \begin{matrix} 0 & 1 \\ 1 & 0 \\ 1 & 0 \end{matrix}\begin{matrix} 0 & 1 \\ 1 & 0 \\ 0 & 1 \end{matrix} \right) and\quad C=\left( \begin{matrix} 1 & 1 \\ 0 & 1 \\ 1 & 1 \end{matrix}\begin{matrix} 0 & 1 \\ 1 & 0 \\ 1 & 1 \end{matrix} \right) \)
\(=\left( \begin{matrix} 0 & 0 \\ 0 & 0 \\ 1 & 0 \end{matrix}\begin{matrix} 0 & 0 \\ 0 & 0 \\ 0 & 1 \end{matrix} \right) \vee \left( \begin{matrix} 1 & 1 \\ 0 & 1 \\ 1 & 1 \end{matrix}\begin{matrix} 0 & 1 \\ 1 & 0 \\ 1 & 1 \end{matrix} \right) \)
\((A\wedge B)\vee C=\left( \begin{matrix} 1 & 1 \\ 0 & 1 \\ 1 & 1 \end{matrix}\begin{matrix} 0 & 1 \\ 1 & 0 \\ 1 & 1 \end{matrix} \right) \)

Given \(A=\left( \begin{matrix} 1 & 0 \\ 0 & 1 \\ 1 & 0 \end{matrix}\begin{matrix} 1 & 0 \\ 0 & 1 \\ 0 & 1 \end{matrix} \right) ,B=\left( \begin{matrix} 0 & 1 \\ 1 & 0 \\ 1 & 0 \end{matrix}\begin{matrix} 0 & 1 \\ 1 & 0 \\ 0 & 1 \end{matrix} \right) and\quad C=\left( \begin{matrix} 1 & 1 \\ 0 & 1 \\ 1 & 1 \end{matrix}\begin{matrix} 0 & 1 \\ 1 & 0 \\ 1 & 1 \end{matrix} \right) \)
\(=\left( \begin{matrix} 1 & 0 \\ 0 & 1 \\ 1 & 0 \end{matrix}\begin{matrix} 1 & 0 \\ 0 & 1 \\ 0 & 1 \end{matrix} \right) \vee \left( \begin{matrix} 0 & 1 \\ 1 & 0 \\ 1 & 0 \end{matrix}\begin{matrix} 0 & 1 \\ 1 & 0 \\ 0 & 1 \end{matrix} \right) \)
\(=\left( \begin{matrix} 1\wedge 0 & 0\wedge 1 \\ 0\wedge 1 & 1\wedge 0 \\ 1\wedge 1 & 0\wedge 0 \end{matrix}\begin{matrix} 1\wedge 0 & 0\wedge 1 \\ 0\wedge 1 & 1\wedge 0 \\ 0\wedge 0 & 1\wedge 1 \end{matrix} \right) \)
\(=\left( \begin{matrix} 0 & 0 \\ 0 & 0 \\ 1 & 0 \end{matrix}\begin{matrix} 0 & 0 \\ 0 & 0 \\ 0 & 1 \end{matrix} \right) \) [∵ a៱b=max(a,b)]

Given \(A=\left( \begin{matrix} 1 & 0 \\ 0 & 1 \\ 1 & 0 \end{matrix}\begin{matrix} 1 & 0 \\ 0 & 1 \\ 0 & 1 \end{matrix} \right) ,B=\left( \begin{matrix} 0 & 1 \\ 1 & 0 \\ 1 & 0 \end{matrix}\begin{matrix} 0 & 1 \\ 1 & 0 \\ 0 & 1 \end{matrix} \right) and\quad C=\left( \begin{matrix} 1 & 1 \\ 0 & 1 \\ 1 & 1 \end{matrix}\begin{matrix} 0 & 1 \\ 1 & 0 \\ 1 & 1 \end{matrix} \right) \)
\(=\left( \begin{matrix} 1 & 0 \\ 0 & 1 \\ 1 & 0 \end{matrix}\begin{matrix} 1 & 0 \\ 0 & 1 \\ 0 & 1 \end{matrix} \right) \vee \left( \begin{matrix} 0 & 1 \\ 1 & 0 \\ 1 & 0 \end{matrix}\begin{matrix} 0 & 1 \\ 1 & 0 \\ 0 & 1 \end{matrix} \right) \)
\(=\left( \begin{matrix} 1\vee 0 & 0\vee 1 \\ 0\vee 1 & 1\vee 0 \\ 1\vee 1 & 0\vee 0 \end{matrix}\begin{matrix} 1\vee 0 & 0\vee 1 \\ 0\vee 1 & 1\vee 0 \\ 0\vee 0 & 1\vee 1 \end{matrix} \right) \)
\(=\left( \begin{matrix} 1 & 1 \\ 1 & 1 \\ 1 & 0 \end{matrix}\begin{matrix} 1 & 1 \\ 1 & 1 \\ 0 & 1 \end{matrix} \right) \) [∵ a∨b=max(a,b)]

If x and y are numbers such that x = y, then x² = y²
Converse statement :
If x and y are numbers such that x² = y² then x = y
Inverse statement :
If x and y are numbers such that x ≠ y then x² ≠ y²
Contrapositive statement :
If x and y are numbers such that x²≠ y² then x ≠ y

Given * on A is commutative
Given b * a = c ⇒ a * b = c
Given c * a = a ⇒ a * c = a
Given b * c = a ⇒ c * b = a
Hence

Given p : Jupiter is a planet and
q : India is an island.
(i) ¬p : Jupiter is not a planet.
(ii) p ∧ ¬q : Jupiter is a planet and India is not an island.
(iii) ¬p ∨ q : Jupiter is not a planet or India is an island.
(iv) p➝ ¬q : If Jupiter is a planet then India is not an island.
(v) p↔q : Jupiter is a planet if and only if India is an island.

(( p ∧ q) ∨ (¬r ∨¬s)) ∧ (¬ t ∧ v)) contains 6 variables p, q, r, s, t, and v. Hence the corresponding truth table will contain 2⁶ = 64 rows.

p ∨ ¬ t ( p ∨ ¬s) contains 3 variables p, s, and t. Hence the corresponding truth table will contain 2³ = 8 rows

(1) ¬p: It is not cold.
(2) p ∧ q: It is cold and raining.
(3) p ∨ q: It is cold or raining.
(4) q ∨ ¬p: It is raining or it is not cold
Observe that the statement formula ¬ p has only 1 variable p and its truth table has 2 = ( 2¹ ) rows. Each of the statement formulae p ∧ q and p ∨ q has two variables p and q. The truth table corresponding to each of them has 4 = (2² ) rows. In general, it follows that if a statement formula involves n variables, then its truth table will contain 2ⁿ rows.

Since the entries in the last column are F, (p ∧ ~p) ∧ (~q ∧ P) is a contradiction

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 *.

The table for the operation x₁₁ is as follows.

Following the same kind of procedure as explained in the previous example, a brief outline of the process of verification of the properties of ×₁₁ on A is given below.
(i) Since each box has an unique element of A, ×₁₁ is a binary operation on A.
(ii) The entries are symmetrical about the main diagonal. Hence ×₁₁ has commutative property.
(iii) As usual, the associative property can be seen to be true.
(iv) The entries of both the row and column headed by the element 1 are identical. Hence 1 is the identity element.
(v) Since the identity 1 exists in each row and each column, the existence of inverse property is assured for ×₁₁. The inverse of 1 is 1, that of 3 is 4, that of 4 is 3, 5 is 9, and, that of 9 is 5.

It is known that Z₅ = {[0], [1], [2], [3], [4]}. The table corresponding to addition modulo 5 is as follows: We take reminders {0,1,2,3,4} to represent the classes {[0], [1], [2], [3], [4]}.

(i) Since each box in the table is filled by exactly one element of Z₅, the output a +₅ b is unique and hence +₅ is a binary operation.
(ii) The entries are symmetrically placed with respect to the main diagonal. So +₅ has commutative property
(iii) The table cannot be used directly for the verification of the associative property. So it is to be verified as usual
For instance, (2+₅3)+₅ 4 = 0+₅ 4 = 4(mod 5)
and 2+₅(3+₅4) = 2 +₅ 2 = 4(mod5)
Hence (2+₅3)+₅4 = 2+₅(3+₅4)
Proceeding like this one can verify this for all possible triples and ultimately it can be shown that +₅ is associative
(iv) The row headed by 0 and the column headed by 0 are identical. Hence the identity element is 0.
(v) The existence of inverse is guaranteed provided the identity 0 exists in each row and each column. From Table, it is clear that this property is true in this case. The method of finding the inverse of any one of the elements of Z₅, say 2 is outlined below.
First find the position of the identity element 0 in the III row headed by 2. Move horizontally along the III row and after reaching 0, move vertically above 0 in the IV column, because 0 is in the III row and IV column. The element reached at the topmost position of IV column is 3. This element 3 is nothing but the inverse of 2, because, 2+₅ 5+ = 0 (mod5). In this way, the inverse of each and every element of Z₅ can be obtained. Note that the inverse of 0 is 0, that of 1 is 4, that of 2 is 3, that of 3 is 2, and, that of 4 is 1.

(i) The output m+ n - mn is clearly an integer and hence∗ is a binary operation on Z.
(ii) m*n = m+ n − mn = n + m − nm = n*m, ∀m,n∈Z. So ∗ has commutative property.
(iii) Consider (m*n)*p = (m+ n −m n)* p= (m+ n −mn) + p − (m+ n −m n) p
= m+ n + p −mn −m p − n p + m n p ... (1)
Similarly m*(n*p) = m*(n + p − n p) = m+ (n + p − n p) −m (n + p − n p)
= m+ n + p − n p −m n −mp + m n p ... (2)
From (1) and (2), we see that m*(n*p) = (m*n)*p. Hence * has associative property.
(iv) An integer e is to be found such that 
m*e = e*m = m, ∀m∈Z ⇒ m + e - m e = m
⇒e(1-m) = 0 ⇒ e = 0 or m = 1. But m is an arbitrary integer and hence need not be equal to 1. So the only possibility is e = 0. Also m*0 = 0*m = m, ∀m∈Z. Hence 0 is the identity element and hence the existence of identity is assured.
(v) An element m'∈ Z is to be found such that m*m' = m' * m = e = 0, ∀m∈Z.
m*m' = 0 ⇒ m+m'-m m'= 0⇒ m m' = 0 ⇒ \(\frac{m}{m-1}\). when m = 1, m' is not defined.
When m = 2, m' is an integer. But except m = 2, m′ need not be an integer for all values of m. Hence inverse does not exist in Z.

Let a = 2, b = -5
∴ a * b = a^b
⇒ 2 * -5 = 2^-5 = \(\frac{1}{2^5}\) ∉ z
* is not a binary operation on z.

Truth Table for ( p V q) ∧ ~q