PAMANTASAN NG LUNGSOD NG VALENZUELA

COLLEGE OF EDUCATION
MATHEMATICS DEPARTMENT

PROPOSITIONAL
LOGIC
 OBJECTIVES
1. Use symbols in expressing logical
statements
2. Construct simple statements and compound
statements and transform in symbolic form.
3. Construct a truth table and identify its truth
values.
4. Translate an argument into logical notation
of propositional functions.
 LOGIC
It is a study of language and
reasoning. It is specifically concerned with
whether the reasoning is correct. Its focus
is more on the relationship among
statements rather than the content of any
particular statement.
 PROPOSITION
is also known as statement. It is a sentence
that is either true or false, but not both. It is
typically expressed as declarative sentence
as opposed to a question, command, etc.
In symbolic logic, we use variables or letters
such as p, q, r, s, and t to symbolize
proposition.
 PROPOSITION
is also known as statement. It is a sentence that is either true or false, but not both. It is
typically expressed as declarative sentence as opposed to a question, command, etc. In
symbolic logic, we use variables or letters such as p, q, r, s, and t to symbolize proposition.

EXAMPLES:
T 1. 𝑝: Sara Duterte is the current vice president
of the Republic of the Philippines.
T 2. 𝑞: An angle measure exactly 180 is a
straight angle.
F 3. 𝑟: The product of 8 and 10 is 18.
F 4. 𝑠: 9 – 5 = 6
 PROPOSITION
is also known as statement. It is a sentence that is either true or false, but not both. It is
typically expressed as declarative sentence as opposed to a question, command, etc. In
symbolic logic, we use variables or letters such as p, q, r, s, and t to symbolize proposition.

NOT A PROPOSITION
1. Why are you studying?
2. Come to class!
3. 6x – 9 = 36 If 𝑥 = 3, then 6𝑥 – 9 = 36.
4. Students are excited to learn Mathematics
in the Modern World
Sheldon is excited to learn Mathematics in the Modern World.
Determine w/c of the following is a proposition. Indicate the
reason why or why not.
1. 𝑞: Find a number which divides your age. Not a Proposition
𝑥
2. 𝑢: 𝑓 𝑥 = is a rational function. False Proposition
𝑥+1
3. 𝑝1 : If you are at least 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 at least 60 years old. True Proposition
4. 𝑟: My seatmate will get a perfect score in the
Logic exam. Proposition (under investigation)
 PROPOSITION
is also known as statement. It is a sentence that is either true or false, but not both. It is
typically expressed as declarative sentence as opposed to a question, command, etc. In
symbolic logic, we use variables or letters such as p, q, r, s, and t to symbolize proposition.

Simple Proposition is a proposition that

can be written with symbols with the use of
single variable.
Compound Proposition is the result of
combining simple propositions or producing
new propositions from existing proposition.
 CONNECTIVES
Statement Connective Symbolic Form Type of Statement

not p not ~𝑝 negation

p and q and 𝑝𝑞 conjunction
p or q or 𝑝˅𝑞 disjunction
If p, then q If…, then 𝑝→𝑞 conditional
p if only if q if and only if 𝑝↔𝑞 biconditional
 NEGATION
Given a proposition 𝑝, the statement that says “not 𝑝”, is a proposition
known as the negation of p. This proposition is true if and only if 𝑝 is
false and is denoted by ~𝑝.
EXAMPLES: 𝑝 ~𝑝
1. p: I am reading a book. T F
~𝑝: I am not reading a book.
F T
2. q: 3 + 4 = 8
~𝑞: 3 + 4 ≠ 8
3. 𝑟: Human needs companionship.
~𝑟: Human does not need companionship.
4. 𝑠: A statement can be simple or compound
~𝑠: A statement can’t be simple or compound.
 CONJUNCTION
Given propositions 𝑝 and 𝑞, the statement “𝑝 𝑎𝑛𝑑 𝑞”, is a proposition
known as the conjunction of 𝒑 and 𝒒. This proposition is true if and
only if 𝑝 and 𝑞 are both true. It is denoted by 𝑝 ∧ 𝑞.
EXAMPLES: p q pq
1. p: It is cold in the room. T T T
q: I forgot to bring my jacket. T F F
p ∧ q: It is cold in the room, and I forgot to F T F
bring my jacket.
2. 𝑝: Toni is watching a movie.
F F F
𝑞: Toni is eating popcorn.
𝑝 ∧ 𝑞: Toni is watching a movie while
eating popcorn.
 DISJUNCTION
Given propositions 𝑝 and 𝑞, the statement “𝑝 𝑜𝑟 𝑞”, is a proposition known
as the disjunction of 𝒑 and 𝒒. This proposition is true if and only if at least
one of 𝑝 or 𝑞 is true. The disjunction of 𝑝 and 𝑞 denoted by 𝑝 ∨ 𝑞.
EXAMPLES: p q pq
1. 𝑠: You will play Mobile Legends. T T T
𝑡: You will study your lesson.
T F T
𝑠 ∨ 𝑡: You will play Mobile Legends or study your
lesson F T T
2. 𝑎: The Philippine government will focus on F F F
agricultural sector.
𝑏: The farmers will die poor.
𝑎 ∨ 𝑏: The Philippine government will focus on
agricultural sector, or the farmers will die poor.
 CONDITIONAL PROPOSITION
Given 𝑝 and 𝑞 propositions, the statement “If 𝑝 then 𝑞” is known as a conditional
proposition. 𝑝 is called the premise, hypothesis or antecedent, while 𝑞 is known
as the consequent or conclusion. We denote this statement by: 𝑝 → 𝑞.
The conditional proposition is false only when the premise is true, and the
conclusion is false.
EXAMPLES:
1. 𝑠: The Philippine government focuses on agricultural
sector.
𝑡: No Filipino farmer is screaming for help today.
𝑠 → 𝑡: If the Philippine government focuses on
agricultural sector, then no Filipino farmer will be
screaming for help today.
 EXAMPLES:
2. 𝑎: You wear a face mask every time you go outside.
𝑏: You have a lower chance to be infected with COVID-19.
𝑎 → 𝑏: If you wear a face mask every time you go outside, then
you will have a lower chance to be infected with COVID-19.

p q p→q
T T T
T F F
F T T
F F T
If 𝑝 → 𝑞, then
𝑝 → 𝑞 ≡ ~𝑞 → ~𝑝
𝑞 → 𝑝 is its converse
𝑞 → 𝑝 ≡ ~𝑝 → ~𝑞
~𝑝 → ~𝑞 is its inverse
𝑝 → 𝑞 ≡ ~𝑝 𝑉 𝑞
~𝑞 → ~𝑝 is its contrapositive
𝑝 → 𝑞: If you live in Malinta, then you live in Valenzuela City
𝑞 → 𝑝: If you live in Valenzuela City, then you live in Malinta.
~𝑝 → ~𝑞: If you’re not living in Malinta, then you’re not living in
Valenzuela City.
~𝑞 → ~𝑝: If you’re not living in Valenzuela City, then you’re not
living in Malinta.
 BICONDITIONAL PROPOSITION
If 𝑝 and 𝑞 are propositions, the statement “𝑝 if and only if 𝑞” is called
a biconditional proposition.
It is true whenever its components 𝑝 and 𝑞 have the same truth values.
We symbolize by 𝑝 ↔ 𝑞.

EXAMPLES:
1. p: A citizen is eligible to vote.
q: A citizen is at least 18 years old.
p ↔ q: A citizen is eligible to vote if and only if
he is at least 18 years old.
 EXAMPLES: p q pq
2. a: You are my biological brother. T T T
b: We have the same parents. T F F
a ↔ b:You are my biological brother if F T F
and only if we have the same parents. F F T

𝑝1 : If you are at least 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 at least 60 years old.
“You are at least 60 years old if and only if
you are entitled to a Senior Citizen's card."
 Symbolize the following propositions using the
symbols stated below.
Consider the following simple statements.
p: Today is Friday.
q: It is raining.
r: I am going to a movie.
s: I am not going to the basketball game.

Today is Friday and it is raining

𝑝Λ𝑞
 Symbolize the following propositions using the
symbols stated below.
Consider the following simple statements.
p: Today is Friday.
q: It is raining.
r: I am going to a movie.
s: I am not going to the basketball game.

It is not raining and I am going to a movie.

~𝑞 Λ 𝑟
 Symbolize the following propositions using the
symbols stated below.
Consider the following simple statements.
p: Today is Friday.
q: It is raining.
r: I am going to a movie.
s: I am not going to the basketball game.

I am going to the basketball game or I am going to a movie.

~𝑠 𝑉 𝑟
 Symbolize the following propositions using the
symbols stated below.
Consider the following simple statements.
p: Today is Friday.
q: It is raining.
r: I am going to a movie.
s: I am not going to the basketball game.

If it is raining, then I am not going to the basketball game.

𝑞→𝑠
 Symbolize the following propositions using the
symbols stated below.
𝑎: Hector will clean his room.
𝑏: Hector will walk the dog.
𝑐: Anthony will wash the dishes.
𝑑: Emman will cook our dinner.
𝑒: Emman will scold us.

Hector will walk the dog or Anthony will wash the dishes.
𝑏∨𝑐
 Symbolize the following propositions using the
symbols stated below.
𝑎: Hector will clean his room.
𝑏: Hector will walk the dog.
𝑐: Anthony will wash the dishes.
𝑑: Emman will cook our dinner.
𝑒: Emman will scold us.

Either Emman will scold us or he will not cook us dinner.

𝑒 ∨ ~𝑑
 Symbolize the following propositions using the
symbols stated below.
𝑎: Hector will clean his room.
𝑏: Hector will walk the dog.
𝑐: Anthony will wash the dishes.
𝑑: Emman will cook our dinner.
𝑒: Emman will scold us.

Anthony will not wash the dishes and Hector will walk the dog
or he will clean his room.
~𝑐 ∧ (𝑏 ∨ 𝑎)
 Symbolize the following propositions using the
symbols stated below.
𝑎: Hector will clean his room.
𝑏: Hector will walk the dog.
𝑐: Anthony will wash the dishes.
𝑑: Emman will cook our dinner.
𝑒: Emman will scold us.

If Hector will not clean his room and will just walk the dog then
definitely Emman will scold us.
(~𝑎 ∧ 𝑏) → 𝑒
 TAUTOLOGY,
CONTRADICTION, AND
CONTINGENCY
 The formula in for the possible number of arrangements is
2n, where n is the number of simple proposition.
21 22 23
p q r

TRUTH p
p
T
q
T
T
T
T
T
T
F
T T F T F T
TABLE F F
F
T
F
T
F
F
T
F
T
F T F
F F T
F F F
 TAUTOLOGY
Tautology originated from the Greek words “tauto”
which means the same and “logos” which means idea or
word. Tautology is defined as the repetitive use of
phrases or words which have similar meanings.
A compound proposition that is always true, no matter
what the truth values of the propositions that occur in it,
is a tautology.
 CONTRADICTION
Contradiction, in Logic, is known as Fallacy
originated from the Latin term “fallare” which
means to device. It refers to errors or mistakes in
belief, reasoning process or an argument that
has insufficient evidence for its conclusion.
A compound proposition that is always false is
called a contradiction.
 CONTINGENCY
A proposition that is
neither a tautology nor a
contradiction is called
contingency.
TAUTOLOGY CONTRADICTION
p  p p  p
𝑝 ~𝑝 𝑝  ~𝑝 𝑝 ~𝑝 𝑝  ~𝑝
T F T T F F
F T T F T F
 CONTIGENCY
p q pq
T T T
p q pq T F F
T T T F T F
T F T F F F
F T T
F F F
Determine whether each of the following compound proposition is
a tautology, contradiction or contingency.
If 8 is even then 49 is a multiple of 7, and 8 is even but 49 is not a
multiple of 7.
𝑎: 8 is even
𝑏: 49 is a multiple of 7
𝒂 → 𝒃 ∧ 𝒂 ∧ ~𝒃 CONTRADICTION
a b ~𝑏 𝑎→𝑏 𝑎 ∧ ~𝑏 𝒂 → 𝒃 ∧ 𝒂 ∧ ~𝒃

T T F T F F
T F T F T F
F T F T F F
F F T T F F
Determine whether each of the following compound proposition is
a tautology, contradiction or contingency.

p → [q → (p  q)]
p q pq q → (p  q) p → [q → (p  q)]

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

TAUTOLOGY
Determine whether each of the following compound proposition is
a tautology, contradiction or contingency.
p → (q  r) CONTINGENCY
p q r qr p → (q 
r)
T T T T T
T T F T T
T F T T T
T F F F F
F T T T T
F T F T T
F F T T T
F F F F T
 QUANTIFIERS
It is a language element that helps in generation of a quantification,
which is a construct that mentions the number of specimens in the given
domain of discourse satisfying a given open formula.

Quantifiers can be classified into two: universal and existential.

Universal quantifier depicts the quantity of a population in whole or
none at all. Existential quantifier describes the quantity in between of
all or nothing – there exists but not certainly all.
 QUANTIFIERS
UNIVERSAL QUANTIFIERS EXISTENTIAL QUANTIFIERS
❑ None ❑ Some
❑ All ❑ Most
❑ Every ❑ There exists
❑ Everyone ❑ At least one
❑ Everybody ❑ Someone
❑ Somebody
 QUANTIFIERS
1. All of you in this class are good in math.
2. No smartphones are expensive.
3. Some students are not capable of having an online class.
4. No airport is open.
5. Some movies are worth the price of admission.
6. Most odd numbers are divisible by 2.
 Negation of Statements with Quantifiers
Case I: Existential Quantifier (without the word "not")
Replace the existential quantifier with a negative universal one.

Case II: Existential Quantifier (having the word "not")

Replace the existential quantifier with a non-negative universal one and omit the word "not" in the statement

Case III: Universal Quantifier (negative)

Replace the negative universal quantifier with any existential one

Case IV: Universal Quantifier (non-negative)

Replace the non-negative universal quantifier with any existential one and add the word "not" in the statement.
 QUANTIFIERS
NOTE: There is no specific answer to a negation of
statements with quantifiers as long as you follow the
steps correctly.

Universal quantifiers can be classified into two:

negative (no, none, no one) and non-negative (all,
every).
 Negation of Statements with Quantifiers
Case I: Existential Quantifier (without the word "not")
Replace the existential quantifier with a negative universal one.

Illustration:
1. 𝑝: Some movies are worth the price of admission.
~𝑝:No movie is worth the price of admission.

2. r: Most odd numbers are divisible by 2.

~𝑟: No odd number is divisible by 2.
 Negation of Statements with Quantifiers
Case III: Universal Quantifier (negative)
Replace the negative universal quantifier with any existential one

Illustration:
1. 𝑝: No smartphone is expensive.
~𝑝: Most smartphones are expensive.

2. r: No one is above the law.

~𝑟: Some people are above the law.
 Negation of Statements with Quantifiers
Case II: Existential Quantifier (having the word "not")
Replace the existential quantifier with a non-negative universal one and omit the word "not" in the statement

Illustration:
1. 𝑝: Some students are not capable of having an online class.
~𝑝: All students are capable of having an online class.

2. r: Many Filipinos do not prefer to have a luxury life.

~𝑟: Every Filipino prefers to have a luxury life.
 Negation of Statements with Quantifiers
Case IV: Universal Quantifier (non-negative)
Replace the non-negative universal quantifier with any existential one and add the word "not" in the statement.

Illustration:
1. 𝑝: Everyone in this class is good in math.
~𝑝: Some in this class are not good in math.

2. 𝑟: All dogs bark.

~𝑟: Some dogs do not bark.
 QUANTIFIERS
Write the negation of the following statements.
1. 𝑝: You will pass this semester
~𝑝: You will not pass this semester.
2. 𝑠: Most of the students are in favor of online class.
~𝑠: None of the students is in favor of online class.
3. 𝑡: Everyone in this class is also taking up Financial Accounting and Reporting.
~𝑡: Some in this class are not taking up Financial Accounting and Reporting.
4. 𝑢: Most of the students have smartphones.
~𝑢: None of the students has smartphones.
5. 𝑣: Human is the only mammal that farts.
~𝑣: Human is not the only mammal that farts.
6. 𝑤: All perfect squares are even numbers.
~𝑤: Most perfect squares are not even numbers.