Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
60 views

N J S. C: Otes by OEL Asibang

1) Mathematical logic is a tool for working with complicated compound statements through a language, notation, and methodology for reasoning about their truth or falsity. It is the foundation for formal proofs in mathematics. 2) A statement or proposition must express a complete thought with a definite meaning and truth value. Logical connectives like conjunction, disjunction, implication, biconditional, and negation join statements and affect their truth values. 3) Quantifiers like "for all" and "there exists" specify how many elements in a domain satisfy a formula. Universal quantification uses "for all" while existential quantification uses "there exists." Negating quantified statements follows generalized De Morgan's laws.

Uploaded by

Michelle Dela Cruz
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
60 views

N J S. C: Otes by OEL Asibang

1) Mathematical logic is a tool for working with complicated compound statements through a language, notation, and methodology for reasoning about their truth or falsity. It is the foundation for formal proofs in mathematics. 2) A statement or proposition must express a complete thought with a definite meaning and truth value. Logical connectives like conjunction, disjunction, implication, biconditional, and negation join statements and affect their truth values. 3) Quantifiers like "for all" and "there exists" specify how many elements in a domain satisfy a formula. Universal quantification uses "for all" while existential quantification uses "there exists." Negating quantified statements follows generalized De Morgan's laws.

Uploaded by

Michelle Dela Cruz
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 25

SOME

ELEMENTARY
LOGIC

NOTES BY JOEL S. CASIBANG


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:

R : Cagayan State University is in Cagayan de Oro.

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
Name Connective Symbol
(key word)

Conjunction and ⋀

Disjunction or ⋁

Implication If... then… →

Biconditional …if and only if… ↔


5
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
TRUTH TABLE CAN BE USED TO TEST
VALIDITY OF AN ARGUMENT
Example:
Let p, q, and r denote the primitive statements given as
p: Jun studies.
q: Jun plays basketball.
r: Jun passes Discrete mathematics.
If Jun studies, then he will pass discrete mathematics.
If Jun doesn’t play basketball, then he’ll study. Jun
failed in Discrete mathematics.
Therefore, Jun plays basketball.
Translate and determine if it is a
valid argument.
SOLVE
SOLUTION:
IMPLICATION
P is the antecedent or hypothesis
 Q is the consequent or conclusion
CONDITIONAL : P → Q
CONVERSE : Q → P
INVERSE : ¬P → ¬Q
CONTRAPOSITIVE : ¬Q → ¬P

9
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
10
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.

Answer: If a function is one-to-one then it has 11


an inverse)
EXERCISE3:
Give the converse, inverse, and contrapositive of the
following conditional statements.
1. If you are more than 60 years old, then you are entitled
to a Senior Citizen's Card
Converse: If you are entitled to a SCC, then you are more
than 60 yrs old.
Inverse: If you are not more than 60 yrs old, then you are
not entitled to a SCC
Contrapositive: If you are not entitled to a SCC, then you
are not more than 60 yrs old.

12
QUANTIFIERS
A constructs that specifies the
quantity of specimens in the
domain of discourse that satisfy a
formula
KINDS:
Universal Quantifier
Existential Quantifier

13
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.

∀𝒙, 𝑷(𝒙)" 𝐢𝐬 𝐓𝐫𝐮𝐞 𝐢𝐟 𝐏(𝐱) 𝐢𝐬 𝐭𝐫𝐮𝐞 𝐟𝐨𝐫 𝐞𝐯𝐞𝐫𝐲 𝐱 𝐢𝐧 𝐃. 14

𝐈𝐭 𝐢𝐬 𝐟𝐚𝐥𝐬𝐞 𝐢𝐟 𝐏 𝐱 𝐢𝐬 𝐅𝐚𝐥𝐬𝐞 𝐟𝐨𝐫 𝐚𝐭 𝐥𝐞𝐚𝐬𝐭 𝐨𝐧𝐞 𝐱 𝐢𝐧 𝐃.


EXAMPLE
1. ∀𝒙, 𝒙𝟐 ≥ 𝟎 , 𝒙 ∈ 𝑹

2. ∀𝒙, 𝒙𝟐 − 𝟏 ≥ 𝟎 , 𝒙 ∈ 𝒁+

3. ∀𝒙, 𝒙𝟐 − 𝟏 ≥ 𝟎 , 𝒙 ∈ 𝑹

4. All birds can fly.

5. Every student in the class wear


socks.
15
EXISTENTIALLY QUANTIFIED
STATEMENT
Definition:
Let P be a propositional function with domain of
discourse D. The statement there exists x, P(x) is said to
be EXISTENTIALLY QUANTIFIED STATEMENT .
The statement there exists x, P(x) may be
written as:
“∃𝒙, 𝑷(𝒙)".
The symbol ∃ means “there exists” and is
called the existential quantifier.

∃𝒙, 𝑷(𝒙)" 𝐢𝐬 𝐓𝐫𝐮𝐞 𝐢𝐟 𝐏(𝐱) 𝐢𝐬 𝐭𝐫𝐮𝐞 𝐟𝐨𝐫 𝐚𝐭 𝐥𝐞𝐚𝐬𝐭


𝐨𝐧𝐞 𝐱 𝐢𝐧 𝐃. 𝐈𝐭 𝐢𝐬 𝐟𝐚𝐥𝐬𝐞 𝐢𝐟 𝐏 𝐱 𝐢𝐬 𝐅𝐚𝐥𝐬𝐞 𝐟𝐨𝐫 16

𝐞𝐯𝐞𝐫𝐲 𝐱 𝐢𝐧 𝐃.
EXAMPLE
1. ∃𝒙, 𝟐𝒙 + 𝟏 = 𝟎 , 𝒙 ∈ 𝒁

𝒙
2. ∃𝒙, >𝟎 𝒙∈𝒁
𝒙𝟐 +𝟏

3. ∃𝒙, 𝒙𝟐 > 𝒙 , 𝒙 ∈ 𝒁−

4. ∃𝒙, 𝒙 > 𝟏 → 𝒙𝟐 = 𝒙 , 𝒙 ∈ 𝑹

5. There exists an elementary student who


can vote for the national election. 17
Multiple Quantifiers such as
∀𝒙∀𝒚 , ∃𝒙∃𝒚, ∀𝒙∃𝒚, etc … are said to be NESTED
QUANTIFIERS. These are propositional
functions with multiple quantifiers involving
more than one variable.

Example:
 ∀𝑥 ∈ 𝑍 + , ∃𝑦 ∈ 𝑅, 𝑦 2 = 𝑥
For every positive integer x, there exists a
real number y such that y squared is equal to x.
TRUE
 ∃𝑥, 𝑦 ∈ 𝑁, 𝑥 − 𝑦 = 𝑦 − 𝑥

There exist Natural numbers x and y such 18

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. 19

¬Q: I do not have a new phone.


TRY THESE!
Negate the following:
1. R: John will spend his Christmas
vacation in Singapore

2. Let A = {1, 3, 5, 7, 9, …}
S: Every number in the set A is odd.

3. T: Some math teachers knows how to


play tong –its. 20
NEGATION
Consider P: All math majors are male.
In symbolic notation:
∀𝑥, 𝑃(𝑥),
predicate: x is male
D: math majors
TRY TO NEGATE .
a. -P: It is false that all math majors are male.
b. -P: There is at least one math major who
is female.
Write in symbol 21

-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. 22
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).

(a). ¬ ∀𝑥, 𝑃 𝑥 ≡ ∃𝑥, ¬𝑃 𝑥


(b). ¬ ∃𝑥, 𝑃 𝑥 ≡ ∀𝑥, ¬𝑃(𝑥)
23
Exercise
Let P(x) denote the statement “x is
attending new GE Course Training”. The
domain of discourse is the set of all math
teachers in SUCs & LUCs.
Write each proposition in words :
a. ∀𝑥, 𝑃 𝑥
b. ∀𝑥, ¬𝑃 𝑥
c. ∃𝑥, 𝑃 𝑥
d. ∃𝑥, ¬𝑃(𝑥)
Write the negation of a - d.
24
Godbless
25

You might also like