Module 2

Lesson 2.1 – Logic

 “

2
 Logic
§ a branch of science that studies correct forms of reasoning
§ it plays a fundamental role in several disciplines as philosophy,
mathematics, and computer science.

§ the study of correct reasoning, especially as it involves the

drawing of inferences.

3
 Symbolic logic
§ the simplest kind of logic - it is a great time-saver in
argumentation
§ it helps prevent logical confusion
§ Its modern development begin with George Boole in
the 19th century
§ can be thought of as a simple and flexible shorthand

4
 Proposition OR Statement
§ Must express a complete
thought.

§ A declarative sentence or
statement that is either true (T)
or false (F) but not both.

5
 Examples
§ Consider the following 1. 2 + 3 = 4
propositions. Which are
true? false? Are there
2. 𝑥 − 4 = 5
possibilities other than 3. 𝑥 + 7 = 7 + 𝑥
true and false?
4. 5 ∙ 𝑥 = 𝑥
5. Sketch the graph of 𝑓(𝑥).

6
 § Exercise:
State whether its a statement or not.

7
 Statement or not?
State whether its a statement or not.
1. Is that your cellphone?
2. Congratulations!
3. Math is interesting.
4. Today is Monday.
5. Please mute your mic.

8
 Statement or not?
State whether its a statement or not.
6. Eight is an even number.
7. Five is more than four.
8. Enjoy the activity.
9. Where’s your friend?
10. Two is an odd number.

9
 Simple and Compound Statements
§ A simple statement § A compound statement is a
contains only one idea. statement formed by joining two
or more simple statements with a
connective.
Example:
§ Manila is the capital of
the Philippines. Example:
§ Frances is reciting in class and
she got a high grade.
10
 Classify each statement as simple or compound.

1. The principal will observe the class on Tuesday or

Wednesday.
2. Cabagan is a city.

3. Five is an odd number and 6 is an even number.

4. If today is Saturday, then tomorrow is Sunday.

5. The zip code of Tuguegarao is 3500.

11
 Quantified Statements
Quantified statements involve terms such as all, each, every, no, none, some, there
exists, and at least one.
§ The first five (all, each, every,
no, none) are called universal
quantifiers because they either
include or exclude every
element of the universal set.
Example:
Every student taking MMW will
pass.
12
§ The latter three (some, there
exists, at least one) are called
existential quantifiers
because they claim the
existence of something, but
don’t include the entire
universal set.
Example:
Some students did not enroll this
semester.
 Quantified Statements and their Negations
Statement Negation
All X are Y. Some X are not Y.

No X are Y. Some X are Y.

Some X are not Y. All X are Y.

Some X are Y. No X are Y.

13
 Examples:
**Give the negation of each quantified statements.
Statement Negation
I took a test today.

My car is red.

All professors in SPUP have cars.

Someone in this class will fail.

14
 Truth Tables
§ A truth table is a table that shows the truth value of
a compound statement for all possible truth values
of its simple statements.

15
 Negation

§ The negation of a statement is a corresponding

statement with the opposite truth value.
The symbol is " ∼ “ or “¬"

§ If a statement is true, its negation is false, and if a

statement is false its negation is true.
16
 Truth Table

§ Examples:
*** What is the negation of the following
statements?
a.) P : 7 is a rational number
b.) Q : 8 is an odd number

17
 Logical Connectives
§ Let P and Q be propositions. A logical connective is
the mathematical equivalent of a conjunction in
English.

§ The most common conjunctions in mathematics

are "and" and "or", which are denoted by “^” and
“v”, respectively.

18
 Logical Connectives
§ If two statements are joined like P and Q, denoted
by P^Q, then P^Q is a statement that is true if and
only if both P and Q are true. [CONJUNCTION]

§ Another logical connective is the word "or". The

statement PvQ is true if and only if P is true or Q is
true, which is taken to include the case when they
are both true. [DISJUNCTION]
19
 Truth Table

§ Given:
P : The square of 5 is 25.
Q : 5 is a composite number.

§ Examples
**What is P^Q? PvQ? P^ ∼Q.

20
 Implication [Conditional]
§ Suppose P and Q are propositions. The proposition P⇒ Q
(read as "if P, then Q") is called an implication. P is called the
premise and Q is called the conclusion.
§ In ordinary language statements like "If it rains, then I bring my
umbrella." is an implication. "If it rains" is the premise (P) while "I
bring my umbrella" is the conclusion (Q).

§ Other ways of reading P ⇒ Q are:

§P implies Q §Q is implied by P
§Q if P §Q only if P
21
 Truth Table

22
 Bi-implication [biconditional]
§ A more complicated form of implication is the bi implication
or the biconditional denoted by the symbol “⇔ ”. The
statement P ⇔ Q is true if and only if both P and Q are either
both true or both false.

§ The sentence P ⇔ Q is equivalent to the statement

P ⇔ Q ≡ (P⇒Q) ^ (Q⇒P )

23
 Truth Table

24
 Example
§ Write the following in symbolic form using P, Q, and R for statements
and the symbols ¬ ,^ , v, ⇔ , ⇒ where
§ P: Pres. Duterte is a good president.
§ Q: Government officials are corrupt.
§ R: People are happy.
a. If Pres. Duterte is a good president, then government officials are not corrupt.
b. If government officials are not corrupt, then the people are happy.
c. If Pres. Duterte is a good president and people are happy, then government officials are
not corrupt.
d. Pres. Duterte is not a good president if and only if government officials are corrupt and
the people are not happy.

25
 Summary of the Truth Table

26
 Converse, Inverse and Contrapositive
§ Suppose P and Q are propositions. Given the implication P⇒Q,
§ Its CONVERSE is Q ⇒P
§ Its INVERSE is ¬P⇒ ¬Q
§ Its CONTRAPOSITIVE is ¬Q⇒ ¬P
§ That is,
§ Given : If P, then Q.
§ Inverse : If not P, then not Q.
§ Converse : If Q, then P.
§ Contrapositive : If not Q, then not P.

27
 Truth Table
§ To determine whether the
conditional statement is true or § Truth table for the inverse,
false, refer to the truth table of the converse and contrapositive.
implication P⇒Q.
Inverse Converse Contra
P Q P⇒Q positive

F F T Q ⇒P ¬P⇒ ¬Q ¬Q⇒ ¬P

F T T T T T

T F F F F T

T T T T T F
T T T

28
 Example:

§ Give the inverse,

converse and
contrapositive.

§ If this test is easy,

then I am taking it.

29
 Example: Inverse:
If this test is not easy,
then I am not taking it.
§ Give the inverse,
converse and Converse:
contrapositive. If I am taking this test,
then it is easy.
§ If this test is easy,
then I am taking it. Contrapositive.
If I am not taking this
test, then it is not easy.
30
 Example:

§ Give the inverse,

converse and
contrapositive.

§ If x is a composite
number, then it is
even.

31
 Example: Inverse:
If x is not a composite
number, then it is not even.
§ Give the inverse,
converse and
Converse:
contrapositive. If x is an even number,
then it is composite.

§ If x is a composite
number, then it is Contrapositive.
even. If x is not an even number,
then it is not composite.

32
 Quantifiers
§ Quantifiers are used to describe the variables in a statement.

§ Universal Quantifiers § Existential Quantifiers

§ Written in the English § Expressed in word as
language as “for all” or “for “there exists” or “for some”
every” and is denoted by and is denoted by the
the symbol “∀” symbol “∃”

§ Take note,
§ When one quantifier is used, order is not important.
§ When mixed quantifiers are used, order is important.
33
 Example:
Write in English statements and determine if the
statement is true or false.

a. ∀ x ∈ R , ∃ y ∈ R, x + y = 7
b. ∀ x ∈ Z+ , ∃ y ∈ R, y2 = x

34
 Your Turn:

35