GE 4

Mathematics in the
Modern World

ENGR. MARC FRANCIS M. LABATA, PH.D. Lecture 7

INSTRUCTOR
TOPIC:

LOGIC

2
Propositions and Truth Value

Definition: A proposition is a declarative sentence that is either true

or false but not both. Propositions are also called statements.

Examples:
• Bongbong Marcos is the president of the Philippines.
• A square has four sides
• 3+5=8
• 2 > -2
• The smallest odd number is 1.

3
Propositions and Truth Value
Exclamations, questions, and demands are not propositions
since they cannot be verified to be true or false

Examples:
• Let’s go!
• How old are you?
• Remember me.
• Keep off the grass
• Long Live the Queen!

4
Exercise
Determine if the following are propositions or not.

1. 2 is an even number.
2. Swim.
3. Stay with me.
4. The golden ratio is an irrational number.
5. He is our GE 4 instructor.

5
Logical Connectives and Truth Tables
• The truth (T) or falsity (F) of a proposition is called truth
value and a table summarizing the truth values of
propositions is called a truth table.
• Simple propositions make only a single statement and
can be combined to form compound propositions.
• The operations to link pairs of propositions are called
logical connectives.
• Propositions are conventionally symbolized by p,q,r…
6
Negation
Its effect is reversing the truth value of the proposition.
The negation of a proposition is stated as “It is not the
case that…”
p ~p
T F
F T

7
Negation
Write the negation of the following propositions:

1. I like pancakes.
2. √2 is a rational number.
3. I live in Tagum City.
4. 4 < 5.
5. It is Monday.

8
Conjunction
Two simple propositions are linked with the word “and”
which results in a new proposition called a conjunctive
proposition.

It will be true whenever both of its components are true.,

otherwise, it is false.

9
Conjunction
p q p^q
T T T
T F F
F T F
F F F
Example:
p: It is raining in Tagum
q: It is Thursday
p^q: It is raining in Tagum and it is Thursday.
10
Disjunction
The word “or” used to link two propositions results in a
new compound proposition called a disjunctive
proposition.

A disjunction is true whenever at least one of its simple

propositions is true.

11
Disjunction
p q p∨q
T T T
T F T
F T T
F F F
Example:
p: I will eat a cookie
q: I will drink milk
p∨ q: I will eat a cookie or I will drink milk.
12
Conditional Connective
Sometimes called implication, it is denoted by ⇒ is the
compound proposition of the form “p implies q” or “If p…,
then q…”
p is called the antecedent (hypothesis) and q is the
consequent (conclusion).

The proposition p is said to be a sufficient condition for q,

and q a necessary condition for p.

13
 Conditional Connective
p q p⇒q
T T T
T F F
F T T
F F T
Example:
p: Maria got 100 in GE 4 prelims.
q: I will give Maria PhP 1,000
p⇒ q: If Maria get 100 in GE 4 prelims, then I will give Maria PhP 1,000.
14
Biconditional Connective
The biconditional proposition with respect to p and q is
the proposition of the form “if p,…and only if q”.

The biconditional proposition is true whenever both of its

components have the same truth value, otherwise it is
false.

15
Biconditional Connective
p q p⟺q
T T T
T F F
F T F
F F T
Example:
p: I eat breakfast
q: I don’t eat lunch.
p⟺ q: I eat breakfast if and only if I don’t eat lunch.
16
Truth Tables and Its Applications
The Standard Truth Table Form is given as:

In constructing truth tables, “work by parts”.

Write the number of combinations of truth

values of the given component.

To determine the number of rows:

r = 2 where n is the number of components.
n

17
Examples:
Construct a truth table for ~ (~p ∨ q) ∨ p.

18
Examples:
Construct a truth table for ~ (p ∨ ~q) ∧ (~p ∨ q).

19
Examples:

Construct a truth table for ~ (p ⇒ ~(q ∨ r))

20
Examples:
Construct a truth table for ~ p ∨ q

∴~p∨q≡p⇒q

21
Examples:
Show that the De Morgan’s Law stated below hold:
~ (p ∧ q) ≡ ~ p ∨ ~q and ~ (p ∨ q) ≡ ~ p ∧ ~q

22