SOME

FUNDAMENTALS
OF LOGIC
Objectives:
At the end of the lesson, you should be able to
perform the following tasks:
1. use different types of reasoning to justify
statements and arguments made about
mathematics and mathematical concepts;
2. write clear and logical proofs;
  LOGIC
It is a discipline that deals with
the methods of reasoning.
It is the study of how to evaluate
arguments and reasoning.
  LOGIC Reasoning
It is used on mathematics to
prove theorems, to verify
correctness of programs (in
computer science) and to prove
theorems.
  Proposition
A statement or proposition, is a
declarative sentence that is either true
or false, but not both.
Examples:
a : Arlene loves Airish.
b: Five is less than eleven.
 TRUTH VALUE

It is the truth and falsity of the

proposition.
   Examples
Can you tell which of the following
propositions are true or false? If it is
false, state why.

1. 9 is a prime number.
   SOLUTION
1. 9 is a prime number.

False, because 9 is a composite

number.
   Examples
Can you tell which of the following
propositions are true or false? If it is
false, state why.

2. 5 + 3 = 8
   SOLUTION
2. 5 + 3 = 8

True.
   Examples
Can you tell which of the following
propositions are true or false? If it is
false, state why.

3. x2 + y2 ≥ 0
   SOLUTION
3. x2 + y2 ≥ 0

True.
   Examples
Can you tell which of the following
propositions are true or false? If it is
false, state why.

4. 10 < -3
   SOLUTION
4. 10 < -3

False, because 10 is greater than .

 Propositional Variable
• It is a variable which is used to
represent a proposition.

FORMAL Propositional Variable

• It is written using propositional logic
notation such as , , and are used
represent propositions.
 Practice Exercises:
Determine whether each of the following statements is a
proposition or not. If it’s a proposition, give its truth value.
1. p: Mindanao is an island in the Philippines.
2. q: Find a number which divides your age.
3. r: My seatmate will get a perfect score in the logic exam.
4. s: Welcome to the Philippines!
5. t: 3 + 2 = 5
6. r: Either logic is fun and interesting, or it is boring.
   LOGICAL CONNECTIVES
It is the mathematical equivalent of a
conjunction in English.

- and / ˄
- or / ˅
- Implies →
COMPOUND PROPOSITION
It is a propositions of two or more
simple propositions connected by
logical connectives.
 Example:
Compound Proposition:
p: Either logic is fun and interesting, or it is
boring.
Simple Propositions:
a: Logic is fun.
b: Logic is interesting.
c: Logic is boring.
 The Truth Table
It is a table that shows the truth value
of a compound statement for all
possible truth values of its simple
proposition.
 Example: p q r
T T T
p q T T F
p T T T F T
T T F T F F
F F T T
F T F T F
F F T
F F F F F
n propositions has
   CONJUNCTION
The conjunction of the proposition p
and q is the compound proposition “p
and q,” denoted as p ˄ q.
- The conjunction of two propositions
is true only if both p and q are true,
otherwise, it is false.
  Truth TABLE for CONJUNCTION

p
T T T
T F F
F T F
F F F
Example: Write the two statements
into conjunction.
P: “Today is Friday.”
Q: “It is a sunny day.”
Solution:
“Today is Friday and it is a sunny
day.”
  DISJUNCTION
The disjunction of the proposition p, q
is the compound proposition “p or q,”
it is denoted as (p ˅ q)
- The disjunction of two propositions
is false when both and are false,
otherwise it is true.
  Truth TABLE for DISJUNCTION

p
T T T
T F T
F T T
F F F
Example: Write the two statements as
disjunction.
p: “Today is Monday.”
q: “It is raining today.”
Solution:
“Today is Monday or it is raining today.”
   EXCLUSIVE OR
• The disjunction, exclusive or, is true
only when exactly one of the
propositions is true. Otherwise, it is
false.
• For example, m: A positive integer
is either positive or even.
  Truth value for EXCLUSIVE OR

T T F
T F T
F T T
F F F
 SUMMARY Truth Table
p q p p
and Or
F F F F F
F T F T T
T F F T T
T T T T F
  NEGATION
A statement is a negation of another
if the word is not introduced in the
negative statement. Let p be a
proposition. The negation of p is “not
p” or .
  NEGATION
- The truth value of the negation of a
proposition is always the reverse of
the truth value of the original
proposition.
  The following is the truth table
for negation:
P ¬P or
T F
F T
 Practice Exercises:
State the negation of the following
propositions:
1. p: is a polynomial function.
2. q: 2 is an odd number.
3. m: The tinikling is the most difficult dance.
4. r: Everyone in Visayas speaks Cebuano.
 Practice Exercises:
Express the ff.
Let p, q, and r are the propositions in English
propositions. sentences.

p: Victor has a date 1. p v q

with Liezel. 2. q v
q: Jan is sleeping. 3. p v (q v r)
r: Anton is eating.
  IMPLICATIONS
• Let and be statements.
• The statement “if then ” is called an
implication or conditional
statements.
• It is denoted as p where is the
hypothesis and is the conclusion
  IMPLICATIONS
or v q

T T T
T F F
F T T
F F T
The conditional proposition is false only when the premise is
true and the conclusion is false.
  IMPLICATIONS
• For example, let P: Today is Sunday
Q: I will wash the car.
• If today is Sunday, then I will wash the
car.
• The converse of this implication is
denoted as :
• If I wash the car, then today is Sunday.
  IMPLICATIONS
• The inverse of this implication is
.
• If today is not Sunday, then I will not wash
the car.
• The contrapositive of this implication is .
• If I do not wash the car, then today is not
Sunday.
 Practice exercises:
Let Form a compound
p: statements as required.
q: 5 is odd
w: is an algebraic number
  biconditionals
• Let and be statements.
• The statement “ if and only if ” is called
biconditional of and .
• The biconditional “P if and only if Q” is
denoted as .
• The phrase “if and only if” can be
rewritten as “iff”
  biconditionals
• Note: Biconditional is also known as
good definition.
• For a statement to be a good
definition, the implication and its
converse must be both true.
• Otherwise, it is not a good definition.
 biIMPLICATIONS/biconditional

T T T
T F F
F T F
F F T
  BICONDITIONAL
• Example:
• : “You can take the flight”
• : “You buy a ticket.”
• Then, : You can take the flight if and
only if you buy a ticket.
 Example
• Write the following statements into
symbolic form using the logical
connectives.
• Let P: The sun is shining.
• Q: It is raining.
• R: The ground is wet.
 Example
• Let P: The sun is shining.
• Q: It is raining.
• R: The ground is wet.
• If it is raining, then the sun is not
shining.
• Answer: Q ~P
 Example
• Let P: The sun is shining.
• Q: It is raining.
• R: The ground is wet.
• It is raining and the ground is wet.

• Answer: Q ^ R
 Example
• Let P: The sun is shining.
• Q: It is raining.
• R: The ground is wet.
• The sun is shining or it is raining.

• Answer:P v Q
 Example
• Let P: The sun is shining.
• Q: It is raining.
• R: The ground is wet.
• The ground is wet if and only if it is
raining and the sun is not shining.

• Answer: R (Q ~P)
 LOGIC & Bit Operators
 LOGIC & Bit Operators
 LOGIC & Bit Operators
 LOGIC & Bit Operators
“If they respect you, respect them. If they
disrespect you, still respect them. Do
not allow the actions of others to
decrease your good manners, because
you respect yourself, not others”.