HAWASSA UNIVERSITY

Collage of Natural and Computational Science

Basic Mathematics for Social Science (2014EC)
Work sheet -1

1. Suppose that the statements p, q, r and s are assigned the truth values T , F, T and F respectively. Find the truth
value of each of the following statements.
⇒ ∨¬ ∧ ⇒ ∨¬ ∨¬ ⇔ ⇒ ∧ ⇒ ⇔ ¬ ∨
a. p (r s) b. (q s) (r p) c. (p q) (s r) d. (r p) (q ( p s))
2. Let p, q and r be a statement. Verify whether the following compound statements are tautology, contradiction or
neither.
a. ¬(p ∨ ¬(q ∧ p)) b. (p ∧ (p ⇒ q)) ⇒ q c. ((p ⇒ q) ∧ (q ⇒ r)) ⇒ (p ⇒ r)

3. For statements p, q and r, use a truth table to show that each of the following pairs of statements is logically
equivalent or not.
a. p ⇒ (q∨r) and (p∧¬q) ⇒ r b. (¬r ∧p) ⇒ q and p ⇒ (q∨r) c. ¬(p∨¬q)∨(¬p∧¬q) and ¬p

4. Determine the truth value of the following statements. √

a. (∃x ∈ N)(x2 +2x +3 = 0)

b. (∀x ∈ R+)( x ≥ 0)
c. (∃x ∈ R)(∃y ∈ R)(x2 − y2 = 1). ∃ ∈ ∀ ∈
d. ( x R)( y R)(x +y =
10).
e. (∀x ∈ R)(∃y ∈ R)(x2 − y = 0). ∀ ∈ ∀ ∈
f. ( x R)( y R)(x +y =
7).
5. Show that the following argument forms are valid by using the
truth table.
⇒ ∨ ¬ ` ⇒ ¬ ⇒ ⇒ `¬ ⇒¬ ⇒
a. p (q r), r, p, q b. p q, p r, r s, qc. p q, p, r q,
6. Show that the following argument forms are valid by using formal ` ¬r
proof.
a. ¬p ∨ q, r ⇒ p, r ` q b. ¬q ⇒ ¬p, r ⇒ p, ¬q ` ¬r ⇒ ⇒ ¬ `
c. p q, q r, r
¬
p
7. Show the following arguments are valid by giving formal proof.
a. If the team is late, then it cannot play the game. If the referee is here,then the team is can play thegame. The
team is late. Therefore, the referee is not here.
b. If the rain comes, the crops are not ruined and the people will not starve. The crops are ruined or thepeople
will starve. Therefore, the rain does not come.

8. Let A ∪ B = {1,2,3,4,5,6} and A ∩ B = {3,5}.

a. If B − A = {1,6} then A = − − − − − − − − − − .
b. If B = {2,5,6} then A − B = − − − − − − − − −.
c. If A − B = ∅ then B = − − − − − − − − − − .

9. Suppose set B is given by B = {x ∈ Z | x2 ≤ 6}

a. How many subsets and proper subsets do the sets B have?
b. find the power set of B?.
10. Find the truth value of the following and justify your conclusion a. ∅ ∈ A for any set A b. {∅} ∈ A for any

set A. c. A 4 A = ∅ for any set A. d. A 4 ∅ = A for any set A. e. ∅ ∈ P (A) for any set A. f. A ⊂ P (A) for any

set A. g. ∅ ∩ {∅} = ∅ h. {∅,{∅}}− {{∅}}=∅ i. {∅,{∅}}− {{∅}}={∅}

11. Let U = { x | x is a positive integer less than 11} A = { x | x ∈ U and x is a f actor of 10}

B = {x ∈ N | x2 ≤ 16}
= { x ∈ U | and x − 4 ∈ U}, then find each of the following.
a.(A
b.(A ∪ B)0 − (C ∩ B)0 0

c.(C − A) 4 (A ∩ (B ∪ C))

12. For any subsets A, B, C of a Universal set U, prove that

a. A
b. A
c. (A ∪ B) = A ∩ B

Answers

Q.1 To find the truth value of each statement, we can substitute the given truth values for the variables and
evaluate the resulting expressions.

a. p ⇒ (r ∨ ¬s) Substituting the given truth values, we have: T ⇒ (T ∨ ¬F) T ⇒ (T ∨ T) T ⇒ T The

truth value of this statement is T.
b. (q ∧ s) ⇒ (r ∨ ¬p) Substituting the given truth values, we have: F ⇒ (T ∨ ¬T) F ⇒ (T ∨ F) F ⇒
T The truth value of this statement is F.
c. (p ∨ ¬q) ⇔ (s ⇒ r) Substituting the given truth values, we have: (T ∨ ¬F) ⇔ (F ⇒ T) T ⇔ T
The truth value of this statement is T.
d. (r ∧ p) ⇒ (q ⇔ (¬p ∨ s)) Substituting the given truth values, we have: (T ∧ T) ⇒ (F ⇔ (¬T ∨
F)) T ⇒ (F ⇔ (F ∨ F)) T ⇒ (F ⇔ F) T ⇒ T The truth value of this statement is T.
Therefore, the truth values of the given statements are: a. T b. F c. T d. T

Q.2 To determine whether the given compound statements are tautologies, contradictions, or
neither, we can use truth tables.
a. ¬(p ∨ ¬(q ∧ p)):
 Create a truth table for the statement:
 p q (q ∧ p) ¬(q ∧ p) (p ∨ ¬(q ∧ p)) ¬(p ∨ ¬(q ∧ p))
T T T F T F

T F F T T F

F T F T T F

F F F T T F
 Since there is at least one row where the statement is false, it is not a tautology.
 Since there is at least one row where the statement is true, it is not a contradiction.
 Therefore, the statement is neither a tautology nor a contradiction.
b. (p ∧ (p ⇒ q)) ⇒ q:
 Create a truth table for the statement:
p q (p ⇒ q) (p ∧ (p ⇒ q)) ((p ∧ (p ⇒ q)) ⇒ q)
T T T T T

T F F F T

F T T F T

F F T F T
 Since the statement is true for all rows, it is a tautology.
 Therefore, the statement is a tautology.
c. ((p ⇒ q) ∧ (q ⇒ r)) ⇒ (p ⇒ r):
 Create a truth table for the statement:
p q r (p ⇒ q) (q ⇒ r) ((p ⇒ q) ∧ (q ⇒ r)) (p ⇒ r) ((p ⇒ q) ∧ (q ⇒ r)) ⇒ (p ⇒ r)
T T T T T T T T

T T F T F F F T

T F T F T F T T

T F F F T F F T

F T T T T T T T

F T F T F F T T

F F T T T T T T

F F F T T T T T
 Since the statement is true for all rows, it is a tautology.
 Therefore, the statement is a tautology.
In summary: a. ¬(p ∨ ¬(q ∧ p)) is neither a tautology nor a contradiction. b. (p ∧ (p ⇒ q)) ⇒ q is a
tautology. c. ((p ⇒ q) ∧ (q ⇒ r)) ⇒ (p ⇒ r) is a tautology.

Q.3To determine whether each pair of statements is logically equivalent, we can construct truth
tables for each statement and compare the resulting truth values.
a. p ⇒ (q∨r) and (p∧¬q) ⇒ r:
p q r q∨r p ⇒ (q∨r) ¬q p∧¬q (p∧¬q) ⇒ r
T T T T T F F T
 p q r q∨r p ⇒ (q∨r) ¬q p∧¬q (p∧¬q) ⇒ r
T T F T T F F T

T F T T T T T T

T F F F F T T F

F T T T T F F T

F T F T T F F T

F F T T T T F T

F F F F T T F T
The truth values for both statements are the same for all possible combinations of truth values for
p, q, and r. Therefore, the statements are logically equivalent.
b. (¬r ∧p) ⇒ q and p ⇒ (q∨r):
p q r ¬r ¬r ∧ p (¬r ∧ p) ⇒ q q∨r p ⇒ (q∨r)
T T T F F T T T

T T F T T T T T

T F T F F T T T

T F F T T F F F

F T T F F T T T

F T F T F T T T

F F T F F T T T

F F F T F T F T
The truth values for both statements are the same for all possible combinations of truth values for
p, q, and r. Therefore, the statements are logically equivalent.
c. ¬(p∨¬q)∨(¬p∧¬q) and ¬p:
p q ¬q p∨¬q ¬(p∨¬q) ¬p ¬p∧¬q ¬(p∨¬q)∨(¬p∧¬q)
T T F T F F F F

T T F T F F F F

T F T T F F F F

T F T T F F F F

F T F F T T F T

F T F F T T F T

F F T T F T T T

F F T T F T T T
The truth values for both statements are the same for all possible combinations of truth values for
p and q. Therefore, the statements are logically equivalent.
In conclusion, both

Q.4
To determine the truth value of the given statements, we need to evaluate whether each statement is true or false.
a. (∃x ∈ N)(x^2 + 2x + 3 = 0) This statement asserts the existence of an integer x such that x^2 +
2x + 3 = 0. However, this quadratic equation has no real solutions, so there is no integer x that satisfies the equation.
Therefore, the statement is false.
b. (∀x ∈ R+)(√x ≥ 0) This statement asserts that for all positive real numbers x, the square
root of x is greater than or equal to 0. Since the square root of any positive number is always non-
negative, this statement is true.

c. (∃x ∈ R)(∃y ∈ R)(x^2 - y^2 = 1) This statement asserts the existence of real
numbers x and y such that x^2 - y^2 = 1. This equation represents a hyperbola, and there are
infinitely many real solutions. Therefore, the statement is true.

d. (∃x ∈ R)(∀y ∈ R)(x + y = 10) This statement asserts the existence of a real number x
such that for all real numbers y, x + y = 10. Since we can choose x = 10 - y, this statement is true.

e. (∀x ∈ R)(∃y ∈ R)(x^2 - y = 0) This statement asserts that for all real numbers x,
there exists a real number y such that x^2 - y = 0. Since we can choose y = x^2, this statement is
true.

f. (∀x ∈ R)(∀y ∈ R)(x + y = 7) This statement asserts that for all real numbers x and y, x
+ y = 7. Since there are infinitely many pairs of real numbers that satisfy this equation, this
statement is true.
In summary: a. False b. True c. True d. True e. True f. True

Q.5
To determine the validity of the argument forms, we can use truth tables.
a. p ⇒ (q ∨ r), ¬r, p, ¬q
p q r q ∨ r p ⇒ (q ∨ r) ¬r ¬q Valid?
T T T T T F F F

T T F T T T F F

T F T T T F T F

T F F F F T T F

F T T T T F F F

F T F T T T F F

F F T T T F T F

F F F F T T T F
Since there is at least one row where all the premises are true but the conclusion is false, the
argument form is invalid.
b. p ⇒ q, ¬p ⇒ r, r ⇒ s, ¬q ⇒ s
p q r s p ⇒ q ¬p ⇒ r r ⇒ s ¬q ⇒ s Valid?
T T T T T T T T T

T T T F T T F F T

T T F T T F T T T

T T F F T F T F T

T F T T F T T T T

T F T F F T T F T

T F F T F T T T T

T F F F F T T F T

F T T T T T T T T

F T T F T T F F T

F T F T T T T T T

F T F F T T T F T

F F T T T T T T T

F F T F T T T F T

F F F T T T T T T

F F F F T T T F T
Since all the rows have true premises and true conclusions, the argument form is valid.
c. p ⇒ ¬q, p, r ⇒ q, ¬r
p q r ¬q p ⇒ ¬q ¬r r ⇒ q Valid?
T T T F F F T F

T T F F F T T T

T F T T T F F T

T F F T T T T

Q.6
To show that the given argument forms are valid, we need to use formal proof techniques. Let's go
through each argument form one by one:
a. ¬p ∨ q, r ⇒ p, r ⇒ q
1. ¬p ∨ q (Premise)
2. r ⇒ p (Premise)
3. r (Premise)
4. ¬p (Assumption)
5. ¬p ∨ q (Reiteration, 1)
 6. q (Disjunction Elimination, 4, 5)
7. p (Modus Ponens, 2, 3)
8. q (Modus Ponens, 6, 7)
Therefore, ¬p ∨ q, r ⇒ p, r ⇒ q is valid.
b. ¬q ⇒ ¬p, r ⇒ p, ¬q ⇒ ¬r
1. ¬q ⇒ ¬p (Premise)
2. r ⇒ p (Premise)
3. ¬q (Premise)
4. ¬q ⇒ ¬r (Premise)
5. ¬r (Modus Ponens, 3, 4)
6. ¬p (Modus Ponens, 1, 3)
7. r (Modus Ponens, 2, 3)
8. p (Modus Ponens, 7, 2)
9. ¬r (Reiteration, 5)
10. ¬p (Reiteration, 6)
Therefore, ¬q ⇒ ¬p, r ⇒ p, ¬q ⇒ ¬r is valid.
c. p ⇒ q, q ⇒ r, ¬r ⇒ ¬p
1. p ⇒ q (Premise)
2. q ⇒ r (Premise)
3. ¬r ⇒ ¬p (Premise)
4. ¬r (Assumption)
5. ¬p (Modus Ponens, 3, 4)
6. p (Modus Ponens, 1, 5)
7. q (Modus Ponens, 6, 2)
8. r (Modus Ponens, 7, 2)
9. ¬r (Reiteration, 4)
Since we have reached a contradiction (¬r and r), the assumption ¬r is false. Therefore, ¬r ⇒ ¬p is
valid.
Therefore, p ⇒ q, q ⇒ r, ¬r ⇒ ¬p is valid.
In conclusion, all three argument forms are valid.

Q.7
To show that the given arguments are valid, we need to provide a formal proof for each argument.

a. Argument 1: Let’s represent the statements as follows: P: The team is late. Q: The
team cannot play the game. R: The referee is here.

The given premises are:

If P, then not Q. (If the team is late, then it cannot play the game.)
If R, then not P. (If the referee is here, then the team can play the game.)
P. (The team is late.)
To prove that the conclusion “Therefore, not R” is valid, we can use a proof by contradiction.
Assume that R is true. Then, from premise 2, we can conclude that not P is true. But from premise
3, we know that P is true. This leads to a contradiction, as both P and not P cannot be true at the
same time. Therefore, our assumption that R is true must be false, which means that not R is true.

Hence, the argument is valid.

b. Argument 2: Let’s represent the statements as follows: P: The rain comes. Q: The
crops are ruined. R: The people will starve.

The given premises are:

If P, then not Q. (If the rain comes, the crops are not ruined.)
Q or R. (The crops are ruined or the people will starve.)
To prove that the conclusion “Therefore, not P” is valid, we can use a proof by contradiction.

Assume that P is true. Then, from premise 1, we can conclude that not Q is true. But from premise
2, we know that Q or R is true. Since not Q is true, R must be true. This contradicts the assumption
that P is true, as both P and R cannot be true at the same time. Therefore, our assumption that P is
true must be false, which means that not P is true.

Hence, the argument is valid.

In both cases, we have provided formal proofs that show the validity of the given arguments.

Q.8
a. To find the set A, we need to subtract the elements in B that are also in A from the set B. In this
case, B – A = {1, 6}. Therefore, A = {2, 3, 4, 5}.
B .To find the set A – B, we need to subtract the elements in B from the set A. In this case, A – B
= {1, 3, 4}.

C .If A – B is an empty set (∅), it means that there are no elements in A that are not in B.
Therefore, B = {1, 2, 3, 4, 5, 6}.

Q.9
a. To determine the number of subsets and proper subsets of set B, we need to consider the number
of elements in set B.
Set B is defined as B = {x ∈ Z | x^2 ≤ 6}. The elements of set B are integers whose squares are
less than or equal to 6.

The elements of set B are {-2, -1, 0, 1, 2}.

To find the number of subsets, we can use the formula 2^n, where n is the number of elements in
the set. In this case, n = 5.

Therefore, the number of subsets of set B is 2^5 = 32.

To find the number of proper subsets, we subtract the empty set and the set itself from the total
number of subsets.

So, the number of proper subsets of set B is 32 – 2 = 30.

c. The power set of a set is the set of all possible subsets of that set.

To find the power set of set B, we need to list all the possible subsets.

The subsets of set B are:

{}, {-2}, {-1}, {0}, {1}, {2}, {-2, -1}, {-2, 0}, {-2, 1}, {-2, 2}, {-1, 0}, {-1, 1}, {-1, 2}, {0, 1}, {0,
2}, {1, 2}, {-2, -1, 0}, {-2, -1, 1}, {-2, -1, 2}, {-2, 0, 1}, {-2, 0, 2}, {-2, 1, 2}, {-1, 0, 1}, {-1, 0, 2},
{-1, 1, 2}, {0, 1, 2}, {-2, -1, 0, 1}, {-2, -1, 0, 2}, {-2, -1, 1, 2}, {-2, 0, 1, 2}, {-1, 0, 1, 2}, {-2, -1, 0,
1, 2}

Therefore, the power set of set B is the set containing all these subsets.

Q.10
To find the truth value of the given statements, let’s analyse each one individually:

A. ∅ ∈ A for any set A: The statement is false. The symbol ∅ represents the empty
set, and it is not an element of any set. Therefore, ∅ is not an element of set A.

B. {∅} ∈ A for any set A: The statement is true. The set {∅} contains the empty set
as its only element. So, for any set A, {∅} can be an element of A.
 C. A 4 A = ∅ for any set A: The statement is false. The symbol 4 represents the
symmetric difference operation, which is the set of elements that are in either of the
sets but not in their intersection. For any set A, the symmetric difference of A with
itself will always be the empty set, not ∅.

D. A 4 ∅ = A for any set A: The statement is true. The symmetric difference of any
set A with the empty set (∅) will always be the set A itself. This is because the
empty set does not contain any elements, so taking the symmetric difference with it
does not change the original set.

E. ∅ ∈ P(A) for any set A: The statement is true. The symbol P(A) represents the
power set of A, which is the set of all possible subsets of A. The empty set (∅) is
always a subset of any set, including A. Therefore, ∅ is an element of P(A) for any
set A.

F. A ⊂ P(A) for any set A: The statement is true. The symbol ⊂ represents the subset
relation. For any set A, every element of A is also a subset of A. Therefore, A is a
subset of P(A) for any set A.

G. ∅ ∩ {∅} = ∅: The statement is true. The symbol ∩ represents the intersection

operation. The intersection of the empty set (∅) with any set is always the empty
set. Therefore, the intersection of ∅ and {∅} is ∅.

H. {∅,{∅}} – {{∅}} = ∅: The statement is false. The symbol – represents the set
difference operation. The set {∅,{∅}} contains two elements: the empty set (∅)
and the set {∅}. When we subtract the set {{∅}} from {∅,{∅}}, we remove the
element {{∅}} from the set. Therefore, the resulting set is {∅}, not ∅.

In summary: A. False B. True C. False D. True E. True F. True G. True H. False

Q.11
To find the values of the given expressions, let’s break down each part step by step:
 a. (A) A is the set of factors of 10 that are positive integers less than 11. The factors of 10 are
1, 2, 5, and 10. However, since we are only considering positive integers less than 11, the
set A is {1, 2, 5}.

b. (A ∪ B)0 – (C ∩ B)0 0 Let’s break this expression down further:

(A ∪ B) represents the union of sets A and B.

A = {1, 2, 5}
B = {1, 2, 3, 4}
The union of A and B is {1, 2, 3, 4, 5}.
(C ∩ B) represents the intersection of sets C and B.
C = {5, 6, 7, 8, 9, 10}
The intersection of C and B is {5}.
(A ∪ B)0 represents the complement of the union of A and B. Since the universal set U is {1, 2, 3,
4, 5, 6, 7, 8, 9, 10}, the complement of {1, 2, 3, 4, 5} is {6, 7, 8, 9, 10}.
(C ∩ B)0 0 represents the complement of the intersection of C and B. The complement of {5} is
{1, 2, 3, 4, 6, 7, 8, 9, 10}.
Therefore, (A ∪ B)0 – (C ∩ B)0 0 is {6, 7, 8, 9, 10}.

c. (C – A) 4 (A ∩ (B ∪ C)) Let’s break this expression down further:

(B ∪ C) represents the union of sets B and C.

B = {1, 2, 3, 4}
C = {5, 6, 7, 8, 9, 10}
The union of B and C is {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}.
(A ∩ (B ∪ C)) represents the intersection of sets A and (B ∪ C).
A = {1, 2, 5}
(B ∪ C) = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
The intersection of A and (B ∪ C) is {1, 2, 5}.
(C – A) represents the set difference of C and A. The set difference of C and A is {6, 7, 8, 9, 10}.
Therefore, (C – A) 4 (A ∩ (B ∪ C)) is {6, 7, 8, 9, 10}.
In summary: a. (A) = {1, 2, 5} b. (A ∪ B)0 – (C ∩ B)0 0 = {6, 7, 8, 9, 10} c. (C – A) 4 (A ∩ (B ∪
C)) = {6, 7, 8, 9, 10}
Q.12