Scribd
Upload
78 views24 pages

Module 3 PROBLEM SOLVING AND REASONING

The document defines logical reasoning and outlines the steps of mathematical induction. It explains that logical reasoning uses rational, systematic steps based on mathematical procedures to arrive at conclusions about problems based on given facts and principles. The document also defines inductive and deductive reasoning, and provides examples of each. Key logical connectives like conjunction, disjunction, conditional statements, biconditional statements, and negation are defined and illustrated with examples. Propositions and truth tables are also discussed.

Uploaded by

Laisa Rarugal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
78 views24 pages

Module 3 PROBLEM SOLVING AND REASONING

The document defines logical reasoning and outlines the steps of mathematical induction. It explains that logical reasoning uses rational, systematic steps based on mathematical procedures to arrive at conclusions about problems based on given facts and principles. The document also defines inductive and deductive reasoning, and provides examples of each. Key logical connectives like conjunction, disjunction, conditional statements, biconditional statements, and negation are defined and illustrated with examples. Propositions and truth tables are also discussed.

Uploaded by

Laisa Rarugal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 24

At the end of this lesson, the learner should

be able to:
o Define logical reasoning;
o Enumerate and illustrate the steps of the
mathematical induction; and
o Prove prepositions by mathematical induction.

Rosiebel A. Abao, MSciEd 9/7/2022 2


The drawing of inferences or conclusions from
known or assumed facts is called “reasoning”.

Every time one solves a problem, one must


first understand the question, collect all
important information, the analyze the problem,
i.e., compare different problems or perhaps use
pictures and formulas to solve the problem.

Rosiebel A. Abao, MSciEd 9/7/2022 3


Logical reasoning is the process of
using rational, systemic steps, based on
mathematical procedure, to arrive at a
conclusion about a problem. You can draw
conclusions based on given facts and
mathematical principles.

Rosiebel A. Abao, MSciEd 9/7/2022 4


 Inductive reasoning – the process of reaching
a general conclusion by examining specific
examples (starts with specifics and move to generalities).
individual observations −> more general conclusion

Examples:
1. Every quiz has been easy. Therefore, the test will be easy.
2. I see fireflies in my backyard every summer. Therefore, This
summer, I will probably see fireflies in my backyard.

Rosiebel A. Abao, MSciEd 9/7/2022 5


3. What is the next number in the sequence 6, 13, 20, 27, …

6, 13, 20, 27, …

Look at the difference of each term.

13-6=7, 20-13=7, 27-20=7

Thus, the next term is 34, since 34-27=7.

Rosiebel A. Abao, MSciEd 9/7/2022 6


Logical Connectives – are basically words or symbols
which are used to form a complex sentence from two
simple sentences by connecting them.

A declarative sentence that is either true or false,


but not both simultaneously is known as statement. A
compound statement may be formed by combining two
or more statements.

Connectives such as and, or, not, and if…then, can


be used in forming compound statements.
Rosiebel A. Abao, MSciEd 9/7/2022 7
Symbols

To simply work
with logic, symbols are
used. Statement are
represented with letters,
such as p, q, or r, while
several symbols for
connectives are shown
beside:

Rosiebel A. Abao, MSciEd 9/7/2022 8


Negation ∼
A statement that is a refusal or denial of some
other statement.

Examples:
a. Statement: The number 9 is odd.
Negation: The number 9 is not odd.

b. Statement: The product of 2 negative numbers is not


positive.
Negation: The product of 2 negative numbers is
positive.
Rosiebel A. Abao, MSciEd 9/7/2022 9
Rosiebel A. Abao, MSciEd 9/7/2022 10
Conjunction ∧
The truth values of the conjunction p and q (𝑝 ∧ 𝑞).
The connective “and” implies “both”.

Example:
Let p – “I study discrete Math”
q – “I study English literature”

Conjunction (𝑝 ∧ 𝑞): “I study discrete Math and I study


English literature”
Note: (𝒑 ∧ 𝒒) is only true if both original propositions are true.

Rosiebel A. Abao, MSciEd 9/7/2022 11


Rosiebel A. Abao, MSciEd 9/7/2022 12
Disjunction ∨
The truth values of the disjunction p or q (𝑝 ∨ 𝑞). The
connective “or” implies “either”.

Example:
Let p – “Mark played basketball today”
q – “Mark played golf today”

(𝑝 ∨ 𝑞): Mark played basketball today or he played golf today.

Note:
• (𝑝 ∨ 𝑞) is true if one or both propositions are true.
• (𝑝 ∨ 𝑞) is false only if both propositions are false.

Rosiebel A. Abao, MSciEd 9/7/2022 13


Rosiebel A. Abao, MSciEd 9/7/2022 14
Conditional Statement →
A compound statement that uses the connective
if…then. 𝑝 → 𝑞 is read as “𝑝 implies 𝑞” or “if 𝑝 then 𝑞”. The
statement 𝒑 is the antecedent, while 𝒒 is consequent.

Example:
Let p – “Bryan is a guitar player”
q – “Bryan is a musician”

( 𝑝 → 𝑞 ): If Bryan is a guitar player, then Bryan is a


musician.
Rosiebel A. Abao, MSciEd 9/7/2022 15
Rosiebel A. Abao, MSciEd 9/7/2022 16
Biconditional Statement ↔
A biconditional statement is a combination of
conditional statement and its converse (opposite). p ↔ 𝑞
is read as “p if and only if q” or “p iff q”. The statement p
is the hypothesis, while q is the conclusion.

Example:
Let p – “You did not try”
q – “You did not fail”

(𝑝 ↔ 𝑞): You did not try if and only if you did not fail.
Rosiebel A. Abao, MSciEd 9/7/2022 17
Rosiebel A. Abao, MSciEd 9/7/2022 18
Propositions:
Let p – The teacher likes Charles.
q – Charles does good work.
r – Charles gets an A.

Symbol Compound Sentence


𝑝∨𝑞 The teacher likes Charles or Charles does good work.
𝑝∧𝑟 Charles does good work and he gets an A.
𝑝→𝑟 If the teacher likes Charles, then he gets an A.
𝑞↔𝑟 Charles does good work if and only if he gets an A.

Rosiebel A. Abao, MSciEd 9/7/2022 19


Let p and q be the propositions “Today is Friday” and “It is
raining today”, respectively. Find
a.) 𝑝 ∧ 𝑞 b.) 𝑝 ∨ 𝑞 c.) 𝑝 → 𝑞 d.) p ↔ 𝑞 e.) ~𝑝

Solution:
a.) 𝑝 ∧ 𝑞: “Today is Friday and it is raining today.”
b.) 𝑝 ∨ 𝑞: “Today is Friday or it is raining today.”
c.) 𝑝 → 𝑞: “If today is Friday, then it is raining today.”
d.) p ↔ 𝑞: “Today is Friday if and only if it is raining today.”
e.) ~𝑝: “Today is not Friday.”

Rosiebel A. Abao, MSciEd 9/7/2022 20


Rosiebel A. Abao, MSciEd 9/7/2022 21
 Deductive reasoning – is the process of
reaching a conclusion by applying general
assumptions, procedures, principles (starts with
specifics and move to generalities).

Here are some examples of deductive reasoning:


 Major premise: All mammals have backbones.
Minor premise: Humans are mammals.
Conclusion: Therefore, humans have backbones.

The above is an example of a syllogism.

Rosiebel A. Abao, MSciEd 9/7/2022 22


To be discuss next meeting…

Rosiebel A. Abao, MSciEd 9/7/2022 23


Thank you and
God Bless!

Note: A activity will follow via


Google Classroom.
Rosiebel A. Abao, MSciEd 9/7/2022 24

You might also like