Professional Documents
Culture Documents
Some Elementary Logic
Some Elementary Logic
ELEMENTARY
LOGIC
Day 2
December 11, 2017
AM, part 2
1
MATHEMATICAL LOGIC
It
is a tool for working with complicated
compound statements. It includes:
• A language for expressing them.
• A concise notation for writing them.
• A methodology for objectively reasoning
about their truth or falsity.
•It is the foundation for expressing formal
proofs in all branches of mathematics
2
STATEMENT OR PROPOSITION
Must express a complete thought
A declarative statement with a definite meaning,
having a truth value that is true or false but not
both
A proposition (statement) may be denoted by a
variable like P, Q, R,…, called a proposition
(statement).
Example:
Possible Exercise:
Determine whether a given sentence is a 3
proposition or not.
LOGICAL CONNECTIVES
Logical Connective is a word or
symbol that joins two sentences to
produce a new one.
1. Conjunction
2. Disjunction
3. Implication
4. Bi-conditional
5. Negation
4
LOGICAL CONNECTIVES
Type of Connective Symbol
statement (key word)
Conjunction and ⋀
Disjunction or ⋁
Negation not ~
TRUTH VALUES
Summary of truth values of compound
statements using logical connectives
P Q P ⋀Q P ⋁Q P → 𝑸 P ↔ 𝐐
T T T T T T
T F F T F F
F T F T T F
F F F F T T
6
NEGATION
CONJUNCTION
DISJUNCTION
EXAMPLE 1
Construct a truth table for ~ (P^Q)
P Q P^Q ~(P^Q)
T T T F
T F F T
F T F T
F F F T
EXAMPLE 2
Construct a truth table for ~ (PVQ)
P Q PVQ ~(PVQ)
T T T F
T F T F
F T T F
F F F T
EXAMPLE 3
Construct a truth table for ~(P^~Q)
P Q ~Q P^~Q ~(P^~Q)
T T F F T
T F T T F
F T F F T
F F T F T
EXAMPLE 4:
18
EXERCISE 1
Symbolize the statement, using capital letters to abbreviate
the simple statements or propositions ( stated positively)
1. If Neil is not a big eater or Len has a big voice,
then Jerry likes violet.
State the premises first:
N: Neil is a big eater
L: Lena has a big voice
J = Jerry likes violet
Answer (¬𝐍 ⋁ L) → 𝐉
2. A man should look for what he is, and not for what
he thinks should be (Albert Einstein).
P: a man should look for what he is
Q: a man should look for he thinks should be
19
Answer: P ^ ¬𝑸
EXERCISE 2:
Write the following in If-Then form
1. The product of two odd integers is an even
integer.
Answer: If two odd integers are multiplied,
then their product is an even integer. (Take note
that it is false.)
2. Every integer that is not odd is divisible by 2.
Answer: If an integer is not odd, then it is
divisible by 2.
3. A function has an inverse if it is one-to-one.
21
QUANTIFIERS
A constructs that specifies the
quantity of specimens in the
domain of discourse that satisfy a
formula
KINDS:
Universal Quantifier
Existential Quantifier
22
UNIVERSALLY QUANTIFIED
STATEMENT
Definition:
Let P be a propositional function with domain of
discourse D. The statement for all x, P(x) is said to be a
UNIVERSALLY QUANTIFIED STATEMENT .
The statement for all x, P(x) may be written
as:
“∀𝒙, 𝑷(𝒙)".
The symbol ∀ means “for all” and is called
the universal quantifier.
2. ∀𝒙, 𝒙𝟐 − 𝟏 ≥ 𝟎 , 𝒙 ∈ 𝒁+
3. ∀𝒙, 𝒙𝟐 − 𝟏 ≥ 𝟎 , 𝒙 ∈ 𝑹
𝐞𝐯𝐞𝐫𝐲 𝐱 𝐢𝐧 𝐃.
EXAMPLE
1. ∃𝒙, 𝟐𝒙 + 𝟏 = 𝟎 , 𝒙 ∈ 𝒁
𝒙
2. ∃𝒙, >𝟎 𝒙∈𝒁
𝒙𝟐 +𝟏
3. ∃𝒙, 𝒙𝟐 > 𝒙 , 𝒙 ∈ 𝒁−
4. ∃𝒙, 𝒙 > 𝟏 → 𝒙𝟐 = 𝒙 , 𝒙 ∈ 𝑹
Example:
∀𝑥 ∈ 𝑍 + , ∃𝑦 ∈ 𝑅, 𝑦 2 = 𝑥
For every positive integer x, there exists a
real number y such that y squared is equal to x.
TRUE
∃𝑥, 𝑦 ∈ 𝑁, 𝑥 − 𝑦 = 𝑦 − 𝑥
that x - y = y - x. TRUE
NEGATION
Negation of mathematical statement
P is denoted by ¬P, read as “not P”.
If P is true, then ¬P is not true.
Example 1:
P: The trainees are sleepy.
¬P: The trainees are not sleepy.
Example 2:
Q: I have a new phone. 28
2. Let A = {1, 3, 5, 7, 9, …}
S: Every number in the set A is odd.
-P: ∃𝒙, −𝑷 𝒙
NEGATION OF QUANTIFIED
STATEMENT
Consider P: Some teachers in CCIT
know how to run a computer program.
In symbolic notation:
∃𝑥, 𝑃(𝑥),
predicate: x know how to run a computer program
D: teachers in CCIT
TRY TO NEGATE
a. -P: It is false that some teachers in CCIT
know how to run a computer program.
b. -P: All teachers in CCIT do not know how
to run a computer program. 31
Write in symbol
-P: ∀𝒙, −𝑷 𝒙
Generalized De Morgan’s
Laws for Logic
If P is a propositional function,
each pair of propositions in (a) and (b)
has the same truth values (i.e.) either
both are true or both are false).