DYBCSDms113; DYBITDms113; DYCPEDis123:

Discrete Structures

MARY ANN T. LIM

Faculty, College of Computer Studies

Declaration:
This learning module is an exclusive property of Dr. Yanga’s Colleges, Inc., as an essential part of the
REIMAGINED Learning Program for the Academic Year 2020-2021, and shall only be used by and for
DYCIans. No part of this learning module shall be reproduced, distributed, transmitted, and/or sold, without
the consent of DYCI.
 <<Week No. 9>>
<<Constructing Truth Tables>>

This module is a continuation of the application of logic, propositions, logical

connectives and constructing truth tables.

At the end of this module, you are expected to:

1. Construct truth tables of propositions.
2. Translate English statement to mathematical logic.

Propositions logic are presented usually in its symbolic form using propositional
variables and logical connectives.

Let’s apply groupings in its symbolic form using parenthesis.

Let p: 0 is a negative number

q: -5 is a negative number
r:  3 is irrational.

Symbolize the following statements:

1. 0 and -5 are both not negative numbers.

Answer: ~p  ~q - both not means negating both propositions.

2. 0 and -5 are not both negative numbers.

Answer: ~ ( p  q ) - not both means negating the result of anding of two
propositions.

3. Either 0 is a negative number or -5 is a negatie number and  3 is irrational.

1
 Answer: ( p  q )  r - Either comes with an or that is why variable p and q
are placed inside the parenthesis and the result of the oring (  ) is
then conjunct (and) with r.

4. Either 0 is a positive number or -5 is a negative number but they are not both
negative numbers.
Answer: ( p  q )  ~ ( p  q ) - first grouping is the either or ( p  q )
Second grouping not both ( p  q )
These groupings are combined using but
which means anding of two compound
propositions.

Let’s try now to translate the following into English statements.

Let p: Today is Sunday.

q: I will stay at home.
r: I’m not going to work.

1. p  ~q - Today is Sunday and I will not stay at home.

2. ~p  q - It is not Sunday today but I will stay at home.
3. r~q - I’m not going to work or I will not stay at home.
4. ( p  q)  ~r - It is both Sunday today and I will stay at home or I’m
going to work.
5. ~p  ( ~q  ~r ) - Today is not Sunday and either I will not stay at home or
I’m going to work.

Constructing Truth Table

As we have discussed on our previous module, There are 2n possible combinations

of truth values to be considered in the truth table where n is the number of propositional
variables. To construct truth table of a compound proposition, let’s have this example.

2
1. p  ~q
- 2n is 22 = 4
- 4 different combinations of truth values from 2 propositional variables

- Negate first q.

- Disjunct p and ~q.

Table 9.1 Truth Table of p  ~q

3
 1. (~ p  ~q)  (p  r)
- 2n is 23 = 8
- 8 different combinations of truth values from 3 propositional variables

- Negate p and q. (~ p  ~q)  (p  r)

- Evaluate (~ p  ~q) and (p  r)

4
- (~ p  ~q)  (p  r)

Table 9.2 Truth Table of

(~ p  ~q)  (p  r)

5
 Name: _____________________________________________ Rating: ________________
Year and Section:_____________ Professor / Instructor: __________________________
Due of Submission: _____________________________

<< Week No.9>>

<< Constructing Truth Table >>

Let p: 2 + 2 = 4
q: 9 is a natural number.
r: 8 is divisible by 2.

I. Write the following statements in terms of p, q and r using logical connectives.

________________ 1. 2 + 2 = 4 and 8 are divisible by 2.

________________ 2. It is not the case that both 9 is a natural number and 2+2 =4.
________________ 3. 2+2 =4 but 8 is not divisible by 2.
________________ 4. It is not true that 9 is a natural number but 2+2=4.
________________ 5. Neither 8 is divisible by 2 nor 9 is a natural number.

II. Construct the truth table of the following compound propositions.

1. ~p  ( q  r)

2. (~p  q)  ~p

6
Malang, P., Malang, B., Tiongson I. and Sandoval, C. 2011. Discrete Structures. HFM
Publishing