You are on page 1of 4

Table Truth

Republic of the Philippines


Eastern Samar State University, Salcedo
Exercises
Salcedo, Eastern Samar
1. Write the truth value for (P ∨ Q) ⇒ R. (Hint: There will be 8 possible truth
S.Y 2020 – 2021 combination for P, Q, and R.

LOGIC
P Q R (P ∨ Q) (P ∨ Q) ⇒ R
T T T T T
T T F T F
T F T T T
T F F T F
F T T T T
F T F T F

and
F F T F T
F F F F T

2. Show that ¬ (P ∨ Q) is equivalent to ¬P ∧ ¬Q.

SET
P Q ¬P ¬Q (P ∨ Q) ¬ (P ∨ Q) ¬P ∧ ¬Q ¬ (P ∨ Q) ⇔ ¬P ∧ ¬Q
T T F F T F F T
T F F T T F F T
F T T F T F F T
F F T T F T T T

THEORY
3. Show that ¬ (P ∧ Q) is equivalent to ¬P ∨ ¬Q.

P Q ¬P ¬Q (P ∧ Q) ¬ (P ∧ Q) ¬P ∨ ¬Q
¬ (P ∧ Q) ⇔ ¬P ∨¬Q
T T F F T F F T
T F F T F T T T
F T T F F T T T
BIONG, JESSA LAISON
F F T T F T T T
20 – 00211
BSED Mathematics 1 4. Show that P ∧ (Q ∧ R) is equivalent to (P ∧ Q) ∧ R.
Chapter 1.
P Q R (Q ∧ R) (P ∧ Q) P ∧ (Q ∧ R) (P ∧ Q) ∧ R Sets
P ∧ (Q ∧ R) ⇔ (P ∧ Q) ∧ R
T T T T T T T T
T T F F T F F T
Exercises
T F T F F F F T
T F F F F F F T 1. Let A = {a, a, b, c} and B = {a, b, c}. Prove that A = B. Thus, the number of items an
F T T F F F F T element is listed does not matter.
F T F F F F F T
Claim: A = B
F F T F F F F T
F F F F F F F T Proof: If A and B are sets. Then, A = B if and only if A ⊆ B and B ⊆ A.
Prove: A ⊆ B
A ⊆ B means that every element of A is also an element of B. therefore if A ⊆
5. Show that P ⇒ (Q ⇒ R) is equivalent to (P ∧ Q) ⇒ R.
B, then, {a, a, b, c} ⊆ {a, b, c}. Since the number of times an element is listed does not
matter, so A ⊆ B.
P Q R (Q ⇒ R) (P ∧ Q) P ⇒ (Q ⇒ R) (P ∧ Q) ⇒ R
P ⇒ (Q ⇒ R) ⇔ (P ∧ Q) ⇒ R
Prove: B ⊆ A
T T T T T T T T
T T F F T F F T B ⊆ A means that every element of B is also an element of A. therefore if B ⊆
T F T T F T T T A, then, {a, b, c} ⊆ {a, a, b, c}. Since the number of times an element is listed does not
T F F T F T T T matter, so B ⊆ A.
F T T T F T T T
Now, since A ⊆ B and B ⊆ A, then it follows that A = B.
F T F F F T T T
F F T T F T T T 2. Let A = {a, b, c} and B = {b, c, a}. Prove that A = B. Thus, the order in which the
F F F T F T T T elements are listed does not matter.
Claim: A = B
Proof: Suppose A and B are sets. A = B if and only if A ⊆ B and B ⊆ A.
6. Show that P ⇒ Q is not equivalent to the converse Q ⇒ P.
In A ⊆ B, every element of A is also an element of B. If set A has element of
P Q P⇒Q Q⇒P {a, b, c} and set B has elements {b, c, a} therefore, A ⊆ B is equal {a, b, c} ⊆ {b,
T T T T c, a}. Since, the order in which the elements are listed does not matter, A ⊆ B.
T F F T
In B ⊆ A, every element of A is also an element of B. If set B has element of
F T T F
{b, c, a} and set A has elements {a, b, c} therefore, B ⊆ A is equal {b, c, a} ⊆ {a,
F F T T
b, c}. Since, the order in which the elements are listed does not matter, B ⊆ A.
Therefore, since A ⊆ B and B ⊆ A, then A = B.

3. Let A = {a} and B = {{a}}. Prove that in general A ≠ B. Thus, the presence of curly
brackets is crucial.
Chapter 2.
1. Let A, B, and C be sets. Prove A × (B ∩ C) = (A × B) ∩ (A × C).
 Let (a, d). then a ∈ A and d ∈ B ∩ C. By the definition of intersection, we
know that d ∈ B or d ∈ C.
Case 1: d ∈ B. Then (a, d) ∈ A × B and we have that (a, d) ∈ (A × B) ∩ (A × C).
4. Prove that if A ⊆ ∅ then A = ∅.
Case 2: d ∈ C. Then (a, d) ∈ A × C and we have that (a, d) ∈ (A × B) ∩ (A × C).
To show A = ∅, we have A ⊆ ∅ and ∅ ⊆ A. Therefore, A = ∅.
2. Let A, B, and C be sets. Prove A × (B \ C) = (A × B) \ (A × C).
5. Prove Claim ③.
 (A × D) \ (A × C) ⊆ A × (B \ C)
Let (a, d) ∈ (A × B) \ (A × C), then (a, d) ∈ (A × B) and (a, d) ∈ (A × C).
Case 1: (a, d) ∈ (A × B). Then a ∈ A and d ∈ B by the definition of the Cartesian
6. Let A be a subset of some universe U. Prove that A ⋂ Ac = ∅. product. So d ∈ B\C and (a, d) ∈ A × (B \ C).
Case 2: (a, d) ∈ (A × C). Then a ∈ A and d ∈ C by the definition of the Cartesian
product. So d ∈ B\C and (a, d) ∈ A × (B \ C).
3. Let X and Y be sets and R, S ⊆ X × Y relations. For a set A, let π× (A) be the
projection of A onto the X axis. Prove that π χ (R ∪ S) = π χ (R) ∪  π χ (S).

7. Let A be a subsets of some universe U. prove that (A ∩ B)c = Ac ∪ Bc. Let R and S be as above. It is true in general that π χ (R ∩ S) = π χ (R) ∩ π χ (S)? Justify
your answer.

 Let (a, d) ∈ π χ (RUS).Then a ∈ π and d ∈ RUS by the definition of union, we


know that d ∈ R or d ∈ S.

Case 1: d ∈ R. Then (a, d) ∈ π × R and we have that (a, d) ∈  π χ R ∪ π χ (S).

Case 2: d ∈ S. Then (a, d) ∈ π × S and we have that (a, d) ∈  π χ R ∪ π χ (S).

8. Let A = {5, 6, 7}. What is P(A)? do not merely describe the set, but rather write down
all the elements.
Let A = {5, 6, 7}
P(A) = {∅, {5}, {6}, {7}, {5, 6}, {5, 7}, {6, 7}, {5, 6, 7}} Chapter 4
Partial Order
Chapter 3 Exercises:
Ordered Pairs and Relations
Exercises: 1. Prove that the relation ⊆ is a partial order on P(A).
2. Let A and B be two subsets of some universe U. Prove that there is a maximal element
C (with respect to the partial order on P(U) given by ⊆) such that C ⊆ A and C ⊆ B, i.e
any other set D satisfying this is a subset of C.

3. Suppose that A is a set and < is a strict partial order on A. prove that ≤ = {(a, b)}: a < b
˅ a = b} is a partial order.

4. Prove that ≤1 ⋂ ≤2 is indeed a relation on A ⋂ B as defined above.

5. Suppose ⧼A, ≤⧽ is a partially ordered set. Prove ≤−1 is also a partial order on A.

You might also like