LOGIC

LESSON 2

MATHEMATICS IN THE MODERN WORLD

1. The principal will visit classes
starting next week.
2. Ouch! I cut my finger.
3. Turn right at the fourth traffic sign.
4. Have you heard of the good news?
5. Please reserve June 20 for me.
PROPOSITION
A proposition is a declarative sentence that is
either true or false, but not both. If a proposition
is true, then its truth value is true which is
denoted by T; otherwise, its truth value is false and
is denoted by F.
Tell whether each of the following statements is a proposition or
not. If a proposition, give its truth value.

Truth Value
1. Manila City is the capital of Philippines.
2. 8 is an even number.
3. 105 is divisible by 10.
4. Get me some flowers in the garden.
5. 1 is the smallest prime number.
Tell whether each of the following statements is a proposition or
not. If a proposition, give its truth value.

Truth Value
6. Welcome to Puerto Galera!
7. Why did you fail the exam?
8. If today is Tuesday, then tomorrow is Wednesday.
9. Leave the door open.
10. Philippines is an Asian country.
SIMPLE PROPOSITION
A proposition is simple if it cannot be broken down
any further into other component propositions. Simple
propositions do not contain connector.

Examples:
1. 𝐩: Manila City is the capital of Philippines.
2. 𝐪: 8 is an even number.
3. 𝐫: 105 is divisible by 10
COMPOUND PROPOSITION
A compound proposition is a proposition form from
simple propositions using logical connectors.
not, and, or, if and then
Example 1.
𝒑𝟏 : It is not the case that 2 is a rational number.
Simple component:
𝑟: 2 is a rational number
𝒑𝟏 : not 𝑟
Example 2.
𝒑𝟐 : Today is Tuesday and tomorrow is Wednesday.
𝑡: Today is Tuesday.
𝑤: Tomorrow is Wednesday.

𝒑𝟐 : 𝑖 and 𝑤
Example 3.
𝒑𝟑 : Either I’m tired or I’m hungry.

𝑡: I’m tired.
𝑤: I’m hungry.

𝒑𝟑 : 𝑡 or ℎ
Example 4.
𝒑𝟒 : If you are more than 60 years old, then you are entitled
to a Senior Citizen’s card, and if you are entitled to a Senior
citizen’s card, then you are more than 60 years old.
s

Simple component:
𝑎: you are more than 60 years old
𝑏: You are entitled to a Senior citizen’s card.

𝒑𝟒 : (if 𝑎, then b) and (if b, then 𝑎)

Example 5.
𝒑𝟐 : Either Math is fun and interesting, or it is boring.
Simple component:
𝑓: Math is fun
𝑖: Math is interesting
𝑏: Math is boring
𝒑𝟐 : 𝑓 and 𝑖, or b
LOGICAL OPERATORS
TRUTH VALUE AND TRUTH TABLES
• The truth value of a simple statement is either true (T) or
false (F).
• The truth value of a compound statement depends on the
truth value of its simple statements and its connectives.
• The truth table is a table that shows the truth value of a
compound statement for all possible truth values of its
simple statements.
MAKING OF TRUTH TABLES
A proposition has two possible values.
𝑝
For proposition, 𝑝 , we have T
the following the table. F

2𝑛 = number of rows, where n is the number of propositions.

For propositions, 𝑝 and 𝑞, we 𝑝 𝑞
have the following table. T T
T F
F T
F F
MAKING OF TRUTH TABLES
Suppose 𝑝, 𝑞 and 𝑟 are propositions. 𝑝 𝑞 𝑟
Then a truth value involving the T T T

given propositions has 23 = 8 rows. T T F

T F T
T F F
F T T
F T F
F F T
F F F
1. NEGATION OF A PROPOSITION
The negation of a proposition 𝑝, is the proposition 𝑛𝑜𝑡 𝑝.
It is denoted by ~𝒑. The truth table of 𝒏𝒐𝒕 𝒑 is given
below.
𝒑 ~𝒑
T F
F T
Let 𝑝 be the proposition.
𝑝: Herbert is good.

Write the following negation as English sentences.

a.)∼ 𝒑
Herbert is not good.
It is not the case that Herbert is good.
2. CONJUNCTION OF PROPOSITIONS
The conjunction of propositions 𝑝 and 𝑞 is denoted by 𝒑⋀𝒒
(read as 𝑝 and 𝑞). This proposition is defined to be true only
when both 𝑝 and 𝑞 are true, and false otherwise. The truth
table of the conjunction of 𝑝 and 𝑞 is given in the following
table.
𝒑 𝒒 𝒑⋀𝒒
T T T
T F F
F T F
F F F
Let 𝑝 and 𝑞 be the following propositions.
𝑝:Today is Monday.
𝑞: It is raining.
Write the following conjunction as English sentences.
a.) 𝒑⋀𝒒
Today is Monday and it is raining.
b.) 𝒑 ⋀ ∼ 𝒒
Today is Monday and it is not raining.
c.)∼ 𝒑⋀ ∼q
Today is not Monday and it is not raining.
3. DISJUNCTION OF PROPOSITIONS
The disjunction of propositions 𝑝 and 𝑞 is denoted by 𝒑⋁𝒒
(read as 𝑝 or 𝑞). This proposition is defined to be false only
when both 𝑝 and 𝑞 are false, and true otherwise. The truth
table of the disjunction of 𝑝 or 𝑞 is given in the following table.

𝒑 𝒒 𝒑⋀𝒒
T T T
T F T
F T T
F F F
Let 𝒑, 𝒒 and 𝒓 be the following propositions.
𝑝: Mother loves his son .
𝑞: Son loves his mother.
Write the following disjunction as English sentences.
a.) 𝒑⋁𝒒 Either mother loves his son or son loves his mother.

b.) ~𝒑⋁~𝒒 Either mother does not love his son or son does not love
his mother.
c.)~(𝒑⋁𝒒) It is not the case that either mother loves his son or
son loves his mother.
4. CONDITIONAL STATEMENT
The conditional of a proposition 𝑝 and 𝑞 is denoted by 𝑝 → 𝑞
(read as ‘if 𝑝, then 𝑞). This statement is defined to be true
when 𝑝 and 𝑞 are true and when 𝑝 is false, no matter what
truth value 𝑞 has.
𝒑 𝒒 𝒑→𝒒
The conditional 𝑝 → 𝑞 may also be read T T T
as ‘𝑝 implies 𝑞’. This proposition 𝑝 is T F F
called the hypothesis, while the F T T
proposition 𝑞 is called the conclusion. F F T
Suppose that today is Tuesday. Consider the following conditionals.
𝑝1 : If today is Tuesday, then tomorrow will be Wednesday.
𝑝2 : If today is Tuesday, then yesterday is Sunday.
𝑝3 : If today is Saturday, then I can wake up late today.

SOLUTION: 𝒑 𝒒 𝒑→𝒒
𝒑𝟏 : TRUE, as the first row of the truth table T T T
asserts. T F F
𝒑𝟐 : FALSE, as the second row of the truth table F T T
indicates. F F T
𝒑𝟑 : TRUE
According to the last two rows of the truth table, 𝑝3 is true regardless of
the truth value of its conclusion.
5. BICONDITIONAL STATEMENT
The biconditional of a proposition 𝑝 and 𝑞 is denoted by 𝑝 𝑞
(read as ‘𝑝 if and only if q’). This statement is defined to be
true when 𝑝 and 𝑞 are both true or both false.

The conditional 𝑝 𝑞 may also be written 𝒑 𝒒 𝒑 𝒒

as ‘𝑝 iff 𝑞’. The propositions 𝑝 and q are T T T
the components of the biconditional. T F F
F T F
F F T
 CONJUNCTION DISJUNCTION
𝒑 𝒒 𝒑⋀𝒒 𝒑 𝒒 𝒑⋁𝒒
T T T T T T
T F F T F T
F T F F T T
F F F F F F
CONDITIONAL BICONDITIONAL
𝒑 𝒒 𝒑→𝒒 𝒑 𝒒 𝒑 𝒒
T T T T T T
T F F T F F
F T T F T F
F F T F F T
PROPERTIES OF PROPOSITION
1. TAUTOLOGY
2. CONTRADICTION
3. CONTINGENCY
TAUTOLOGY
• A compound proposition is called tautology if and only
if it is true for all possible values of its propositional
variables.
• It contains only T (Truth) in last column of its truth
table.
CONTRADICTION
• A compound proposition is called contradiction if and
only if it is false for all possible values of its
propositional variables.
• It contains only F (False) in last column of its truth
table.
CONTINGENCY
• A compound proposition is called contingency if and
only if it is neither a tautology nor a contradiction.
• It contains both T (True) and F (False) in last column
of its truth table.
 (𝒑⋀𝒒) → (𝒑 → 𝒒)
REMEMBER ME!
Conditional
Conjunction Conditional Conjunction (⋀) – TRUE
only if both are true.

Disjunction (⋁) – FALSE

𝒑 𝒒 𝒑⋀𝒒 𝒑→𝒒 (𝒑⋀𝒒) → (𝒑 → 𝒒) only if both are false.
T T T T T
Conditional (→) – FALSE
T F F F T only if true points to
false.
F T F T T
F F F T T Biconditional ( ) –
TRUE if truth values are
the same.
Since the truth values of the proposition are all TRUE for all
possible values of the variables, the proposition is a tautology.
 (𝒑⋀𝒒)⋀~𝒑
REMEMBER ME!

Conjunction Conjunction Conjunction (⋀) – TRUE

Negation only if both are true.

𝒑 𝒒 𝒑⋀𝒒 ~𝒑 (𝒑⋀𝒒)⋀~𝒑 Disjunction (⋁) – FALSE

only if both are false.
T T T F F
T F F F F Conditional (→) – FALSE
only if true points to
F T F T F false.

F F F T F Biconditional ( ) –
TRUE if truth values are
Since the truth values of the proposition are all FALSE for all the same.
possible values of the variables, the proposition is a
contradiction.
 ~𝒑⋁~𝒒
REMEMBER ME!
Negation Disjunction Conjunction (⋀) – TRUE
Negation only if both are true.

𝒑 𝒒 ~𝒑 ~𝒒 ~𝒑⋁~𝒒 Disjunction (⋁) – FALSE

only if both are false.
T T F F F
T F F T T Conditional (→) – FALSE
only if true points to
F T T F T false.

F F T T T Biconditional ( ) –
TRUE if truth values are
Since the truth values of the proposition are neither true nor the same.
false for all possible values of the variables, the proposition is
a contingency.
 NATURE OF LOGIC

(𝒑⋀~𝒑) → 𝒒
REMEMBER ME!

𝒑 𝒒 ~𝒑 (𝒑⋀~𝒑) (𝒑⋀~𝒑) → 𝒒 Conjunction (⋀) – TRUE

only if both are true.
T T F F T
T F F F T Disjunction (⋁) – FALSE
only if both are false.
F T T F T
Conditional (→) – FALSE
F F T F T only if true points to
false.
Since the truth values of the proposition are all TRUE for all Biconditional ( ) –
possible values of the variables, the proposition is a TRUE if truth values are
tautology. the same.
 NATURE OF LOGIC

𝒑 ∨ (𝒒 ∧ 𝒓)
𝑝 𝑞 𝑟
T T T
T T F
T F T
T F F
F T T
F T F
F F T
F F F
 NATURE OF LOGIC

(𝒑 ∨ 𝒒) ∧ (𝒑 ∨ 𝒓)
𝑝 𝑞 𝑟
T T T
T T F
T F T
T F F
F T T
F T F
F F T
F F F
FORMS OF CONDITIONAL PROPOSITION

A conditional statement has two parts: a hypothesis

(antecedent), denoted by P and a conclusion
(consequent), denoted by Q. If symbols, the statement “if
P then Q” is written as 𝑃 → 𝑄.

If it is 9:30 a.m., then it must be daytime.

FORMS OF CONDITIONAL PROPOSITION
Conditional Statement 𝑷→𝑸
Converse 𝑸→𝑷
Inverse ~𝑷 → ~𝑸
Contrapositive ~𝑸 → ~𝑷
 Example 1
p: n is an even number q: n+1 is an odd number
1. Conditional Statement 𝑷→𝑸
2. Converse 𝑸→𝑷
3. Inverse ~𝑷 → ~𝑸
4. Contrapositive ~𝑸 → ~𝑷

1. If n is an even number, then n+1 is an odd number.

2. If n+1 is an odd number, then n is an even number.
3. If n is not an even number, then n+1 is not an odd number.
4. If n+1 is not an odd number, then n is not an even number.
 Conditional: 𝑷 → 𝑸 Converse: 𝐐 → 𝑷
𝑷 𝑸 𝑷→𝑸 𝑷 𝑸 𝑸→𝑷
T T T T T T
T F F T F T
F T T F T F
F F T F F T

Inverse: ~𝑷 → ~𝑸 Contrapositive: ~𝑸 →
𝑷 𝑸 ~𝑷 ~𝑸 ~𝑷 → ~𝑸 𝑷 𝑸 ~𝑷 ~𝑷
~𝑸 ~𝑸 → ~𝑷
T T F F T T T F F T
T F F T T T F F T F
F T T F F F T T F T
F F T T T F F T T T
 Conditional Converse Inverse Contrapositive
𝑷 𝑸 𝑷→𝑸 𝑸 → 𝑷 ~𝑷 → ~𝑸 ~𝑸 → ~𝑷
T T T T T T
T F F T T F
F T T F F T
F F T T T T

• Converse and inverse are equivalent.

• Conditional and contrapositive are equivalent.
 Example 2
Show that the two given compound propositions are equivalent.
a. ~ 𝑃 ∨ 𝑄 𝑎𝑛𝑑 ~𝑃 ∧∼ 𝑄
For ~ 𝑷 ∨ 𝑸 For ~𝑷 ∧∼ 𝑸
𝑷 𝑸 𝑃∨𝑄 ~ 𝑃∨𝑄 𝑷 𝑸 ∼𝑷 ∼ 𝑸 ~𝑃 ∧∼ 𝑄
T T T F T T F F F
T F T F T F F T F
F T T F F T T F F
F F F T F F T T T

~ 𝑃 ∨ 𝑄 𝑎𝑛𝑑 ~𝑃 ∧∼ 𝑄 are equivalent since they have the same truth values.
 Example 2
Show that the two given compound propositions are equivalent.
a. ~ 𝑃 ∧ 𝑄 𝑎𝑛𝑑 ~𝑃 ∨∼ 𝑄
For ~ 𝑷 ∧ 𝑸 For ~𝑷 ∨∼ 𝑸
𝑷 𝑸 𝑃∧𝑄 ~ 𝑃∧𝑄 𝑷 𝑸 ∼𝑷 ∼ 𝑸 ~𝑃 ∨∼ 𝑄
T T T F T T F F F
T F F T T F F T T
F T F T F T T F T
F F F T F F T T T

~ 𝑃 ∧ 𝑄 𝑎𝑛𝑑 ~(𝑃 ∨∼ 𝑄)are equivalent since they have the same truth values.
 De Morgan’s Law

• ~ 𝑃 ∨ 𝑄 ≡ ~𝑃 ∧∼ 𝑄
• ~ 𝑃 ∧ 𝑄 ≡ ~𝑃 ∨∼ 𝑄
 Example 3
Using De Morgan’s Law, write statement equivalent to:
“It’s not true that Matthew is a mathematician and comedian.”

Let P: Matthew is a mathematician.

Q: Matthew is a comedian.

The given statement in symbol is ~ 𝑃 ∧ 𝑄 which has an equivalent

statement of ~𝑃 ∨∼ 𝑄. This can be translated as:

“Matthew is not a Mathematician or Matthew is not a comedian.”

Negating Conjunction/Disjunction
Write the negation of each statement:
A. 𝑃 ∨∼ 𝑄 B. I’m going to Baguio and Bohol
Disjunction: 𝑃 ∨∼ 𝑄 Conjunction: I’m going to Baguio and I’m
going to Bohol.
Negation:
∼ 𝑃 ∨∼ 𝑄 Negation:
∼ 𝑃 ∧∼ ∼ 𝑄 I’m not going to Baguio or I’m not going to
∼𝑷∧𝑸 Bohol.
 Example 4
Write a statement that is equivalent to:
“If Norman fails, he will take summer class and cannot travel.”
Let P: Norman fails.
Q: Norman will take summer class.
R: Norman can travel.
Write the conditional statement in symbolic form: 𝑷 → (𝑸 ∧∼ 𝑹)
An equivalent statement is the contrapositive
∼ (𝑄 ∧∼ 𝑅) →∼ 𝑃
∼ 𝑄 ∨∼ (∼ 𝑅) →∼ 𝑃 De Morgans Law for Negation a Conjunction
∼ 𝑸 ∨ 𝑹 →∼ 𝑷
“Norman will not take summer class or can travel, then he will not
fail.”
 Negation of a Conditional Statement
To form the negation of a conditional statement,
1. Leave the antecedent unchanged
2. Change the if-then connective to and; and
3. Negate the consequent
 Example 6
Write the negation of the following:
a. If the music is playing, then I cannot concentrate.
Given statement: If the music is playing, then I cannot concentrate.
Negation: The music is playing and I can concentrate.

b. ∼ 𝐴 → ~𝐵
Given statement:∼ 𝐴 → ~𝐵
Negation: ∼ 𝐴 ∧ 𝐵