MATHEMATICAL LOGIC

GED102
 Symbolic Logic
is a powerful tool for analysis and communication in
mathematics. The main parts of symbolic logic are
statements and connectives.

Statement
is an assertion which can be regarded as true or false. A statement
is simple if it conveys a single thought, otherwise, it is a compound
statement. A compound statement is formed by using logical
connectives.
EXAMPLE
TABLE 1.1
“GUESS THE SYMBOLIC
FORM”
ℎ: Harry is not happy. 𝑣: Harry is going to watch a volleyball game. 𝑟: It
is going to rain. 𝑠: Today is Sunday.

Today is Sunday and Harry is not happy.

ℎ: Harry is not happy. 𝑣: Harry is going to watch a volleyball game. 𝑟: It
is going to rain. 𝑠: Today is Sunday.

^ ~

Today is Sunday and Harry is not happy.

ℎ: Harry is not happy. 𝑣: Harry is going to watch a volleyball game. 𝑟: It
is going to rain. 𝑠: Today is Sunday.

If it is going to rain, then Harry is not going to watch a volleyball

game.
ℎ: Harry is not happy. 𝑣: Harry is going to watch a volleyball game. 𝑟: It
is going to rain. 𝑠: Today is Sunday.

~ ~

If it is going to rain, then Harry is not going to watch a volleyball

game.
Propositional Logic
Recall: A proposition is a statement that is either “true” of
“false”.

Examples
1) p: 1 is a prime number
truth value: F
2) q: The BS Civil Engineering program in Mapua is
ABET accredited.
truth value: T
Propositional Logic
Propositional logic is concerned with the evaluation of the
“truth value” of a (simple or compound) proposition.

For compound propositions, the truth value may be determined by

using truth tables, which shows all possible combinations of the truth
values of the component (simple) propositions and the corresponding
truth value of the entire compound proposition.
!
TRUTH
TABLES
TRUTH TABLES
Logical Equivalence
Two mathematical statements are logically equivalent if the
final output of their truth tables are exactly alike.
De Morgan’s Law
 Predicate Logic
A predicate is a proposition that contains one or more
variables. Thus, a predicate is a proposition with
parameters.

Example:
Proposition: “p: 2 is even”
Predicate: “p(x): x is even”

Predicate logic deals with “sets of entities” (as compared to

propositional logic – deals with propositions with
specific domain)
Quantifiers in Predicate
Logic
1. Universal : “all”, “every”
Symbolism: If S is a set and P(x) is a statement about the
element x, then the expression
∀𝑥𝜖𝑆 𝑃(𝑥)
means “For all x in S, P(x) is true” or “P(x) is true for
every x in S”.
Quantifiers in Predicate
Logic
2. Existential : “some”, “there exists”
Symbolism: If S is a set and P(x) is a statement about the
element x, then the expression
∃𝑥𝜖𝑆 𝑃(𝑥)
means “There exists x in S for which P(x) is true” or
“There is at least one x in S for which P(x) is true for”.
Translating quantified
statements
1. Every odd integer is a prime number.
Symbolism: ∀𝑥, 𝑖𝑛𝑡𝑒𝑔𝑒𝑟(𝑥, 𝑜𝑑𝑑 → 𝑥, 𝑝𝑟𝑖𝑚𝑒)
or ∀𝑥𝜖𝑍(𝑜 𝑥 → 𝑝 𝑥 )
Here, we use ``𝑜(𝑥)′′ to symbolize “x is odd” while
“𝑝(𝑥)” means “𝑥 is prime”
Common Mistake: ∀𝑥𝜖𝑍(𝑜 𝑥 ⋀ 𝑝 𝑥 )
Truth Value : False or “F” (why?)
Translating quantified
statements
2. Some right triangles are also isosceles.
Symbolism: ∃𝑥,𝑡𝑟𝑖𝑎𝑛𝑔𝑙𝑒(𝑟(𝑥) ∧ 𝑖(𝑥))
Common Mistake: ∃𝑥,𝑡𝑟𝑖𝑎𝑛𝑔𝑙𝑒(𝑟 𝑥 → 𝑖 𝑥 )
Truth Value : True or “T”

3. No real number is divisible by 0.

Symbolism: ∀𝑥(𝑥𝜖R) → ~𝑑 (𝑥)
Here, we use ``𝑑(𝑥)′′ to symbolize “x is divisible by 0”
Common Mistake: ~∃𝑥(𝑟 𝜖 R ⋀ 𝑑 (𝑥) )
Truth Value : T
Logical Equivalences in
Predicate Logic
1. ~∀𝑥 𝑃 𝑥 ↔ ∃𝑥(~𝑃 𝑥 )
Example: “Not all college graduates have good manners” is
equivalent to any of the following:
“There are some college graduates who does not
have good manners”
“There exists a college graduate who has no
good manners”
Logical Equivalences in
Predicate Logic
2. ∀𝑥 𝑃 𝑥 ↔ ~∃𝑥(~𝑃 𝑥 )
Example: “All college graduates have good manners”
is equivalent to any of the following:
“There are no college graduates who does not
have good manners”
“It is not true that there are some college
graduates who have no good manners”
THANK YOU!