(M10-MAIN) Truth Table Analysis and Statement Forms
(M10-MAIN) Truth Table Analysis and Statement Forms
(M10-MAIN) Truth Table Analysis and Statement Forms
Ex.
All humans are mortal. → 𝐴𝑙𝑙 𝐻 𝑎𝑟𝑒 𝑀
𝐴𝑙𝑙 𝐻 𝑎𝑟𝑒 𝑀 𝐻
Instead of individual categories (terms), whole propositions
or statements are represented in symbols (capital letter of
the main component in the statement)
1. Santa exists. → 𝑆
2. Manila is the capital of the Philippines. → 𝑀
3. We went to Intramuros yesterday. → 𝐼
A statement that contains two or more statements as
components
Components:
𝑆 𝑜𝑟 𝑃
2. Manila is both the capital and the most populous place
in the Philippines.
Components:
𝐶 𝑎𝑛𝑑 𝑃
3. We went to Intramuros yesterday and the day before
that.
Components:
We went to Intramuros yesterday
and
We went to Intramuros the day before yesterday.
𝑌 𝑎𝑛𝑑 𝐵
5 Basic Connectives
Compound statements are characterized by connectives
that relate the individual components. There are 5 basic
connectives, each symbolized as such:
Type Connective Statement Form
Conjunction (and) • 𝑝 • 𝑞
Negation (not) ˜ ~𝑝
Disjunction (or) ∨ 𝑝 ∨ 𝑞
Conditional (if-then) ⊃ 𝑝 ⊃ 𝑞
Biconditional (if and only if) ≡ 𝑝 ≡ 𝑞
A truth-functional connective meaning “and,” symbolized by
the dot, •. A statement of the form 𝑝 • 𝑞 is true if and only if p
is true and q is true.
Ex. Manila is both the capital of the Philippines and its most
populous city.
𝐶 • 𝑃
Every statement is either true or false. This can be best
visualized using a truth table:
Conjunction (𝑝 • 𝑞)
𝑝 𝑞 𝑝 • 𝑞
T T T
T F F
F T F
F F F
The table shows us the possible combination of the truth
values of the components, and what would happen to the
truth value of the whole statement:
Conjunction (𝑝 • 𝑞)
𝑝 𝑞 𝑝 • 𝑞
T T T
T F F
F T F
F F F
In this case, the statement 𝑝 • 𝑞 would only be true if and
only if both p and q are true at the same time; otherwise the
statement is false
Conjunction (𝑝 • 𝑞)
𝑝 𝑞 𝑝 • 𝑞
T T T
T F F
F T F
F F F
Denial; symbolized by the tilde (~𝑝) simply means “it is not
the case that p,” and may be read as “not-p.”
T F
F T
A disjunctive statement asserts that either p or q is true. The
component statements p and q are called the disjuncts, and
the connective “or” is represented by ∨—the “vee” or “wedge”
sign.
𝑆 ∨ 𝐿
2. Either the Tamaraws or the Falcons will win the basketball
champions.
a. The Tamaraws will win. → 𝑇
b. The Falcons will win. → 𝐹
𝑇∨𝐹
The statement 𝑝 ∨ 𝑞 will only be false if both 𝑝 and 𝑞 are
false; otherwise the statement is true. This is expressed by
the truth table:
Disjunction (𝑝 ∨ 𝑞)
𝑝 𝑞 𝑝∨𝑞
T T T
T F T
F T T
F F F
𝑝 ⊃ 𝑞
A hypothetical statement; a compound proposition or
statement of the form “If 𝑝 then 𝑞.” In such a statement, 𝑝 is
called the antecedent and 𝑞 is the consequent. The
connection between them, the if–then relationship, is
represented by the symbol ⊃, called the “horseshoe.” A
statement involving this connective says that if the
antecedent is true, the consequent is true as well.
1. If it’s raining, then the ground is wet.
𝑅 ⊃ 𝑊
𝑝 𝑞 𝑝⊃𝑞
T T T
T F F
F T T
F F T
A biconditional statement is true when the two components
have identical truth values; they are either both true or
both false. Also known as equivalence, a biconditional is
indicated by a triple bar, as in 𝑝 ≡ 𝑞.
𝐽 ≡ 𝑀
𝑝 ≡ 𝑞
Let’s say, 𝐴 and 𝑌 are true, while 𝑋 is false. What is the truth
value of the whole statement?
Let’s say, 𝐴 and 𝑌 are true, while 𝑋 is false. What is the truth
value of the whole statement?
Simplified as:
[𝑇 ⊃ 𝐹 ] ⊃ [(𝑇 ⊃ 𝐹 ) ∨ (𝑇 ⊃ 𝑇)]
F because for conjunctions (𝑝 • 𝑞), both have to be true for the whole to be true.
Pay attention to the connectives inside parentheses first, just
like in a mathematical equation.
Simplified as:
[𝑇 ⊃ 𝐹 ] ⊃ [𝐹 ∨ (𝑇 ⊃ 𝑇)]
Simplified as:
[𝑇 ⊃ 𝐹 ] ⊃ [𝐹 ∨ 𝑇]
[𝑇 ⊃ 𝐹 ] ⊃ [𝐹 ∨ 𝑇]
Simplified as:
𝐹 ⊃ [𝐹 ∨ 𝑇]
[𝑇 ⊃ 𝐹 ] ⊃ [𝐹 ∨ 𝑇]
Simplified as:
𝐹 ⊃ 𝑇
T because for disjunctions (𝑝 ∨ 𝑞), only one component is required to be true for the
whole statement to be true.
Finally:
𝐹 ⊃ 𝑇
Simplified as:
T