Republic of the Philippines

POLYTECHNIC UNIVERSITY OF PHILIPPINES

Sta. Mesa, Manila

Name: Christal G. Falame

_______________________________________ Score: _____________
Course/Year/section: BSCE 1-2
__________________________ Date: November 13, 2021
______________
Mathematics in the Modern World

Activity 2: Propositions and Logical Connectives

I. Give the negation of the following statements (if exists):

1. The sun rises in the east.
2. Every mother has a husband.
3. 2 – 2 = 3
4. There exist a rooster that lay eggs.
5. Hello! My friend.
II. Given the following simple propositions, form the compound statements as required.
𝑝: Jane is playing Tennis.
𝑞: Jane is eating.
𝑟: Lexie is running.
𝑡: Lexie is combing her hair.
1. 𝑝∨𝑞
2. 𝑟∧~𝑡
3. ~𝑝 ∨ ~𝑟
4. ~(𝑟∧𝑞)
5. (𝑝∧𝑟) ∨ (𝑞∧𝑡)

III. Construct a truth table for each proposition.

(a) [(p ∧ q) ∨ r] ↔ [(p ∧ r) ∨ (q ∧ r)]

(b) [(p ∧ r) → (q ∧ ¬r)] → [(p ∧ q) ∨ r)]

IV. Prove the De Morgan’s Laws by constructing truth tables.

Name: Christal G. Falame Score:

Course/Year/Section: BSCE 1-2 Date: November 13, 2021

MATHEMATICS IN THE MODERN WORLD

Activity 2: Propositions and Logical Connectives

I. Give the negation of the following statements (if exists):

1.)
p: The sun rises in the east. True
~p: The sun does not rise in the east. False

2.)
q: Every mother has a husband. False
~q: Some mother has no husband. True
3.)
r: 2 – 2 = 3 False
~r: 2 – 2 ≠ 3 True
4.)
p: There exist a rooster that lay eggs. False
~p: All rooster does not lay eggs. True

5.)
Hello! My friend. (does not exist since it is not a declarative sentence but a
greeting)

II. Given the following simple propositions, form the compound statements as required.
p: Jane is playing Tennis
q: Jane is eating
r: Lexie is running
t: Lexie is combing her hair
 1.) Disjunction
p V q: Either Jane is playing Tennis or she is eating.
2.) Conjunction
r ꓥ ~t: Lexie is running but she is not combing her hair.

3.) Disjunction
~p V ~r: Either Jane is not playing tennis or Lexie is not running.
4.) Conjunction
~(r ꓥ q): It is not true that Lexie is running and Jane is eating.

5.) Disjunction
(p ꓥ r) V (q ꓥ t): Either Jane is playing Tennis and Lexie is running or Jane
is eating and Lexie is combing her hair.

III. Construct a truth table for each proposition.

(a) Contingency
p q r pꓥq [(p ꓥ q) V r] pꓥr qꓥr [(p ꓥ r) V (q ꓥ r)] [(p ꓥ q) V r] ↔ [(p ꓥ r) V (q ꓥ r)]
1 1 1 1 1 1 1 1 1
1 1 0 1 1 0 0 0 0
1 0 1 0 1 1 0 1 1
1 0 0 0 0 0 0 0 1
0 1 1 0 1 0 1 1 1
0 1 0 0 0 0 0 0 1
0 0 1 0 1 0 0 0 0
0 0 0 0 0 0 0 0 1

(b) Contingency

p q r ~r pꓥr q ꓥ ¬r [(p ꓥ r) → (q ꓥ ¬r)] pꓥq [(p ꓥ q) V r] [(p ꓥ r) → (q ꓥ ¬r)] → [(p ꓥ q) V r]

1 1 1 0 1 0 0 1 1 1
1 1 0 1 0 1 1 1 1 1
1 0 1 0 1 0 0 0 1 1
1 0 0 1 0 0 1 0 0 0
0 1 1 0 0 0 1 0 1 1
0 1 0 1 0 1 1 0 0 0
0 0 1 0 0 0 1 0 1 1
0 0 0 1 0 0 1 0 0 0

IV. Prove the De Morgan’s Laws by constructing truth tables.

De Morgan’s Laws:

1.) ~(P ꓥ Q) = (~P) V (~Q)

P Q ~P ~Q PꓥQ ~(P ꓥ Q) (~P) V (~Q)

1 1 0 0 1 0 0

1 0 0 1 0 1 1

0 1 1 0 0 1 1

0 0 1 1 0 1 1

2.) ~(P V Q) = (~P) ꓥ (~Q)

P Q ~P ~Q PVQ ~(P V Q) (~P) ꓥ (~Q)

1 1 0 0 1 0 0

1 0 0 1 1 0 0

0 1 1 0 1 0 0

0 0 1 1 0 1 1