Professional Documents
Culture Documents
Propositions and Truth Value PDF
Propositions and Truth Value PDF
and Truth
Value
Define and identify propositions
Learning Write compound propositions in
Objectives symbolic form to English sentence
and vice versa
Define the logical connectives
Proposition
A proposition (or statement) is a declarative
statement which is true or false, but not both.
Propositions
Examples: The following are propositions:
Malayan Colleges Laguna is in Cabuyao.
The door is open.
Manny Pacquiao is a boxer.
Davao is in Luzon.
Propositions
Examples: The following are not propositions
Are you going out somewhere?
2+3
Which of the following are propositions?
a. 144 is an even number.
Exercise: b. Did you cheat in the exam?
c. This statement is false.
d. All birds can fly.
e. Quezon City is our nation’s capital.
f. Doctors have bad handwritings.
g. 3 + 2 = 5
h. Close the door.
Propositional
Logic
A branch of symbolic logic dealing with propositions as
units and with their combinations and the connectives that
relate them. It is the study of how simple propositions can
come together to make more complicated propositions.
Propositional Logic
Example:
p = “Magsaysay was the president.”
q = “Our whole section will pass MAT01.”
r = “Christmas was not the same without you.”
Propositions
Simple Compound
Proposition Proposition
Simple
Proposition
A proposition is simple if it contains only one idea.
Compound
Proposition
A proposition is compound if it is composed of at least two
simple propositions joined together by logical connectives.
Compound Propositions
In propositional logic, we Then we form compound
assume a collection of propositions by using logical
“atomic” propositions are connectives (logical
given: operators) to form
propositional “molecules”.
𝑝, 𝑞, 𝑟, 𝑠, 𝑡, …
Propositions
Simple Compound
Proposition Proposition
p ~p p q p q
F T T T T
T F T F F
F T F
F F F
Compound Propositions
NEGATION
This just turns a false proposition to true and the opposite for a
true proposition.
Example: p: “23 = 15 + 7”
p happens to be false, so ~𝒑 is true.
So ~𝒑 has the truth value true whenever evaluated.
Compound Propositions
NEGATION – truth table
Logical operators are defined by truth tables – tables which
give the output of the operator in the right-most column
Here’s the truth table for negation:
𝒑 ~𝒑
F T
T F
Let E: e represents an irrational number
𝒑 𝒒 𝒑∧𝒒
T T T
T F F
F T F
F F F
Let P: Carlo is competitive.
Q: Carlo is hardworking.
CONJUNCTION Express 𝑃 ∧ 𝑄 as English sentence.
Example:
𝑷 ∧ 𝑸: Carlo is competitive and hardworking.
Other possible forms:
Carlo is competitive but hardworking.
Carlo is competitive yet hardworking.
Compound Propositions
DISJUNCTION – truth table
Disjunction is true when at least one of the components is true.
Words: “or”, “unless” 𝒑 𝒒 𝒑∨𝒒
T T T
T F T
F T T
F F F
Let P: a = 0
Q: b = 0
DISJUNCTION Express 𝑃 ∨ 𝑄 as English sentence.
Example:
𝑷 ∨ 𝑸: a = 0 or b = 0
Other possible forms:
a = 0 unless b = 0
either a = 0 or b = 0
Let P: It is cold.
Q: It is raining.
SAMPLE Give a simple verbal sentence which describes
EXERCISE: each of the following statements.
a. ∼ 𝑃 c. 𝑃 ∨ 𝑄
b. 𝑃 ∧ 𝑄 d. 𝑃 ∧∼ 𝑄
Compound Propositions
CONDITIONAL (Implication)
This one is probably the least intuitive. It’s only partly akin to
the English usage of “if, then” or “implies”.
DEFINITION: 𝒑 → 𝒒 is true if q is true, or if p is false. In the final
case, (p is true while q is false) 𝒑 → 𝒒 is false.
Compound Propositions
CONDITIONAL – truth table
𝒑 𝒒 𝒑→𝒒
T T T
T F F
F T T
F F T
Compound Propositions
CONDITIONAL Synonyms
There are many ways to express the conditional statement 𝒑 → 𝒒:
If p, then q.
p implies q.
If p, q.
q only if p.
p is sufficient for q.
In 𝑷 → 𝑸, we refer to P as antecedent and Q as
consequent.
CONDITIONAL
Let P: I saved some money.
Example:
Q: I will invest in stock market.
Express as 𝑷 → 𝑸
Some possible forms:
1. If I saved some money, then I will invest in
stock market.
2. I will invest in stock market only if I saved
some money.
Compound Propositions
CONDITIONAL (Implication)
Consider the conditional proposition 𝑷 → 𝑸. Its converse, inverse,
and contrapositive are defined, respectively, as follows:
𝑸→𝑷 Converse
~𝑷 → ~𝑸 Inverse
~𝑸 → ~𝑷 Contrapositive
CONDITIONAL Given the conditional proposition below, state
its converse, inverse, and contrapositive in
Example: sentence form:
Contrapositive:
If you do not deserve a reward, then you are not
honest.
Compound Propositions
BICONDITIONAL
If 𝒑 ↔ 𝒒 is true, you say that p and q are logically equivalent.
That is, they will be true under exactly the same circumstances.
For 𝒑 ↔ 𝒒 to be true, p and q must have the same truth value.
Else, 𝒑 ↔ 𝒒 is false.
Compound Propositions
BICONDITIONAL – truth table
𝒑 𝒒 𝒑→𝒒
T T T
T F F
F T F
F F T
Compound Propositions
BICONDITIONAL
The following examples illustrate different ways a biconditional
can be expressed in sentence form.
The function 𝑓 is even if and only if 𝑓 𝑥 = 𝑓(−𝑥).
𝑓 𝑥 = 𝑓(−𝑥) is a necessary and sufficient condition for the
function 𝑓 to be even.
Let P: Cruise ships only go on big rivers.
BICONDITIONAL Q: Cruise ships go on the Hudson.
Example: R: The Hudson is a big river.