Академический Документы
Профессиональный Документы
Культура Документы
I. Propositional Logic
Proposition – a declarative sentence that is either true or false, but not both. If a proposition is
true, its truth value is denoted by T; otherwise, if a proposition is false, its truth value is denoted
by F.
Propositions are usually denoted by small letters. For example:
Examples
Simple Proposition – one that cannot be broken down any further into other component
propositions.
Compound Proposition – a proposition formed from simpler propositions using logical
connectors, or some combination of logical connectors.
Examples
1) p:The teacher is willing to conduct tutorials if more than 10 students will submit the request.
2) q: Mei is a student of Mapua.
3) r: Chef Damian’s dish is not Italian.
4) s: 9.74 is an integer.
5) t: Our MATH01 teacher is handsome and awesome.
6) u: Greet the person seated next to you.
7) v: Due to the strong typhoon, the classes will either be suspended or not.
8) w: Welcome to G132!
1) Conjunction (⋀): The AND operation of two propositions p and q(𝑝⋀𝑞) is true if both propositions
are true; if not, then the AND operation is false.
p q 𝒑∧𝒒
T T T
T F F
F T F
F F F
Examples of Conjunction
a) Ferdinand Marcos became the president of the Philippines and Imelda Marcos is Ferdinand’s
wife. What is the truth value of 𝑝 ∧ 𝑞?
b) Love must be unconditional and love must be selfish. What is the truth value of 𝑝 ∧ 𝑞?
c) Aaron is a girl and Deseree is a student. What is the truth value of 𝑝 ∧ 𝑞?
d) Manila is the capital of Malaysia and Kuala Lumpur is the capital of the Philippines. What is the
truth value of 𝑝 ∧ 𝑞?
2) Disjunction (∨): The OR operation of two propositions p and q(𝑝 ∨ 𝑞) is true if at least one of the
propositional statements is true; otherwise, if both propositions are false, then the OR operation is
false.
p q 𝒑∧𝒒
T T T
T F T
F T T
F F F
Examples of Disjunction
3) Negation (~): The negation of a proposition p (written as ~p) is false when p is true; on the other
hand, the negation of a proposition p is true when p is false.
p ~𝒑
T F
F T
Examples of Negation
4) Conditional / Implication (→): An implication 𝑝 → 𝑞 is the proposition, “If p, then q.” If p is true
and q is false, then the truth value is false; otherwise, the truth value is true. In this logical
connective, p is the hypothesis (premise) and q is the conclusion (consequence).
p q 𝒑→𝒒
T T T
T F F
F T T
F F T
a) Converse – computed by interchanging the hypothesis and the conclusion. If the statement
is, “If p, then q,” the converse will be, “If q, then p.” In other words, 𝑞 → 𝑝is the converse of
𝑝 → 𝑞.
b) Inverse – the negation of both the hypothesis and the conclusion. If the statement is, “If p,
then q,” the inverse will be, “If not p, then not q.” In other words, ~𝑝 → ~𝑞 is the inverse of
𝑝 → 𝑞.
c) Contrapositive – computed by interchanging the hypothesis and the conclusion of the
inverse statement. If the statement is, “If p, then q,” the contrapositive will be, “If not q, then
not p.” In other words, ~𝑞 → ~𝑝 is the contrapositive of 𝑝 → 𝑞.
a) If Allen finishes college, his parents will be happy. What is the truth value of 𝑝 → 𝑞?
b) If Ken uses Lacoste perfume, then Kyla is in love with Judiel. What is the truth value of 𝑝 → 𝑞?
c) If the sun is cold, then Gaurav will pass MATH01. What is the truth value of 𝑝 → 𝑞?
d) If humans are immortal beings, then Mapua University can fly. What is the truth value of 𝑝 → 𝑞?
e) Given the statement, “If you do your homework, you will not be punished,” provide the converse,
inverse, and contrapositive.
5) Biconditional (↔): A biconditional 𝑝 ↔ 𝑞 is the proposition, “p if and only if q.” If both statements
are true or both statements are false, then the truth value is true; otherwise, if one is false, then
the truth value is automatically false.
p q 𝒑→𝒒
T T T
T F F
F T F
F F T
Examples of Biconditional
a) The concern will only be addressed if and only if the students will sign the letter.
b) James Reid will stay with ABS-CBN if and only if Nadine Lustre will transfer to GMA 7.
c) The world will not end if and only if Rodrigo Duterte is the president of the Philippines.
d) Dolphins will survive on land if and only if Mapua is a restaurant.
6) Exclusive-Or (⊕):The XOR operation of two propositions (𝑝 ⊕ 𝑞)is true if and only if one is true
and the other is false.
p q 𝒑⨁𝒒
T T F
T F T
F T T
F F F
7) Exclusive-Nor (⊙): The XNOR operation of two propositions (𝑝 ⊙ 𝑞) is true if both statements
have the same truth values; otherwise, if one is true and the other is false, the truth value will be
false.
p q 𝒑⊙𝒒
T T T
T F F
F T F
F F T
8) Nor (Nor): The NOR operation of two propositions is true if both propositions are false; otherwise,
the truth value is false.
p q 𝒑 𝒏𝒐𝒓 𝒒
T T F
T F F
F T F
F F T
IV. Truth Table
Truth Table – a diagram in rows and columns showing how the truth or falsity of a proposition
varies with that of its components.
Tautology (𝝉) – a proposition that is always true.
Contradiction (𝝓) – a proposition that is always false.
Contingency – a formula that has both some true and some false values for every value
of its propositional variables.
Examples
Let p and q be propositions. Construct the truth table of the following, and determine if each
formula is Tautology, Contradiction, or Contingency.
1) (𝑝 → 𝑞) ∧ (𝑞 → 𝑝)
p q
T T
T F
F T
F F
3) (𝑝 ∧ ~𝑞) ∧ (𝑝 ∧ 𝑞)
p q
T T
T F
F T
F F
6) 𝑝 ∨ 𝜏
p 𝝉
T T
T T
F T
F T
7) 𝑝 ∧ 𝜙
p 𝝓
T F
T F
F F
F F
V. Logical Equivalence
Logically Equivalent Propositions – denoted by 𝑝 ⟺ 𝑞, and occur if they have the same truth
values for all possible truth values of their simple components.
Examples
PROPOSITION REASON
~(𝑝 → 𝑞)
𝑝 ∧ (~𝑞)
PROPOSITION REASON
~𝑝 → ~𝑞
𝑞→𝑝
PROPOSITION REASON
(𝑝 ∧ ~𝑞) ∨ 𝑞
𝑝∨𝑞
Table of Fallacies
𝑝 → (𝑟 ∧ 𝑠)
~𝑟
∴ ~𝑝
PROPOSITION REASON
~𝑟
~𝑝