SEMA 30053 MIDTERM EXAMINATION

Instructions: Answer the following completely.

1. Give five (5) sentences which are not propositions and five (5) sentences which are
propositions. For not propositions, justify why they are not propositions, and for
propositions, give their truth values.

PROPOSITION
1. Seven is less than three and four is greater than two.
a: Seven is less than three.
b: Four is greater than two.
a b a∧b
T T T
T F F
F T F
F F F

2. December 25 is Christmas day or January 1 is New Year’s day.

a: December 25 is Christmas day.
b: January 1 is New Year’s day.
a b a∨ b
T T T
T F T
F T T
F F F

3. If Malolos is the capital of Bulacan then Aklan is the capital of Boracay.

a: Malolos is the capital of Bulacan.
b: Aklan is the capital of Boracay.
a b a→b
T T T
T F F
F T T
F F T

4. Eggplant is a vegetable or apple is a fruit, and sugar is not sweet.

a: Eggplant is a vegetable.
b: Apple is a fruit.
c: Sugar is sweet.
~c: Sugar is not sweet.
a b c ~c (a ∨ b) (a ∨ b) ∧ ~c

T T T F T F
T T F T T T
T F T F T F
T F F T T T
F T T F T F
 F T F T T T
F F T F F F
F F F T F F

5. Violet is a primary color and if and only if orange is secondary color.

a: Violet is a primary color.
b: Orange is secondary color.
a b a↔b
T T T
T F F
F T F
F F T

NOT PROPOSITION
1. Who bake this cookies?
It is not proposition sentence is not declarative. It is an interrogative sentence.
2. 2x +4=5
It is not proposition since we do not know the value of 𝑥. Thus, we cannot tell whether the
equation is true of false.
3. I am so happy for you!
It is not proposition sentence is not declarative. It is an interrogative sentence.
4. The solution to x2 +3x-7 is 9.
It is not proposition since we do not know the value of 𝑥. Thus, we cannot tell whether the
equation is true or false.
5. Jane is beautiful.
This is a declarative sentence, but a subjective one. Jane can be beautiful for your eyes but
not in all people. Thus, we cannot tell whether the sentence is true or false.

2. Construct the truth table of the following and tell whether it is a tautology,
contradiction, or contingency.
a. (∼ (𝑚 ∨ 𝑛) → 𝑝) ∨ ((𝑛 ∨ 𝑚) →∼ 𝑝)

m n p ~p 𝑚∨𝑛 ∼(𝑚∨𝑛) ∼(𝑚∨𝑛)→𝑝 𝑛∨𝑚 (𝑛∨𝑚)→∼𝑝 (∼(𝑚 ∨ 𝑛) → 𝑝)

∨ ((𝑛 ∨ 𝑚) →∼𝑝)
T T T F T F T T F T
T T F T T F T T T T
T F T F T F T T F T
T F F T T F T T T T
F T T F T F T T F T
F T F T T F T T T T
F F T F F T T F T T
F F F T F T F F T T
Since all the truth values in the last column are true, then it is a tautology.

b. (𝑠 ↔ 𝑡) → (𝑡 ∧ (∼ 𝑢 → 𝑥))
s t u ~u x 𝑠↔𝑡 ∼𝑢→𝑥 𝑡∧(∼𝑢→𝑥) (𝑠↔𝑡) → (𝑡∧(∼𝑢→𝑥))
T T T F T T T T T
T T T F F T T T T
T T F T T T T T T
T T F T F T F F F
T F T F T F T F T
T F T F F F T F T
T F F T T F T F T
 T F F T F F F F T
F T T F T F T T T
F T T F F F T T T
F T F T T F T T T
F T F T F F F F T
F F T F T T T F F
F F T F F T T F F
F F F T T T T F F
F F F T F T F F F
The proposition is a contingency as shown in the last column.

3. Verify the logical equivalence of the following:

a. ((𝑎 ∨∼ 𝑏) ∧ (∼ 𝑎 ∧ 𝑏)) ≡ (𝑎 ∨∼ 𝑎)
((𝑎 ∨∼ 𝑏) ∧ (∼ 𝑎 ∧ 𝑏)) ≢ (𝑎 ∨∼ 𝑎)

a ~a b ~b 𝑎 ∨∼ 𝑏 ∼𝑎∧ 𝑏 ((𝑎 ∨∼ 𝑏) 𝑎 ∨∼ 𝑎
∧ (∼ 𝑎 ∧ 𝑏))
T F T F T F F T
T F F T T F F T
F T T F F T F T
F T F T T F F T
b. ∼ (𝑝 ∨ (𝑞 → 𝑟)) ≡ (∼ 𝑝 ∧ (𝑞 ∨∼ 𝑟))
∼ (𝑝 ∨ (𝑞 → 𝑟)) ≢ (∼ 𝑝 ∧ (𝑞 ∨∼ 𝑟))
p ~p q ~q r ~r 𝑞→𝑟 𝑝∨(𝑞→𝑟) ~(𝑝∨(𝑞→𝑟)) 𝑞 ∨∼ 𝑟 (∼ 𝑝 ∧ (𝑞 ∨∼ 𝑟))
T F T F T F T T F T F
T F T F F T F T F T F
T F F T T F T T F F F
T F F T F T T T F T F
F T T F T F T T F T F
F T T F F T F F T T T
F T F T T F T T F F F
F T F T F T T T F T T

4. Test the validity of the following argument using truth tables.

If today is Monday, then Joanna is not going to the mall.

If Joana is not going to the mall, then Marvin is playing basketball.
Therefore, today is Monday if and only if Mavin is going to the mall.

a: Today is Monday.
b: Joanna is going to the mall.
a→b
~b: Joanna is not going to the mall. ~b→c
c: Marvin is playing basketball. ∴a↔d
d: Mavin is going to the mall. (a→b) ∧ (~b→c) →(a↔d)
(a→b) ∧ (~b→c) →(a↔d)
THE ARGUMENT IS NOT VALID.

a b ~b c d (a→~b) ~b→c (a→b) ∧ (~b→c) a↔d (a→b) ∧ (~b→c) →(a↔d)

T T F T T F T F T T
T T F T F F T F F T
T T F F T F T F T T
T T F F F F T F F T
T F T T T T T T T T
T F T T F T T T F F
T F T F T T F F T T
T F T F F T F F F T
F T F T T T T T F F
F T F T F T T T T T
F T F F T T T T F F
F T F F F T T T T T
F F T T T T T T F F
F F T T F T T T T T
F F T F T T F F F T
F F T F F T F F T T

Deadline of submission is on January 18, 2021.