0% found this document useful (0 votes)
2 views

Week 12 Lesson Slides

The document outlines various rules of inference used to derive new statements from existing propositions, essential for constructing valid arguments. It includes definitions and examples of logical operations such as negation, conjunction, disjunction, conditional, and biconditional statements. Additionally, it presents specific rules of inference like Modus Ponens, Modus Tollens, and Disjunctive Syllogism, along with their tautological forms and applications in evaluating the validity of arguments.

Uploaded by

elfavenir
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views

Week 12 Lesson Slides

The document outlines various rules of inference used to derive new statements from existing propositions, essential for constructing valid arguments. It includes definitions and examples of logical operations such as negation, conjunction, disjunction, conditional, and biconditional statements. Additionally, it presents specific rules of inference like Modus Ponens, Modus Tollens, and Disjunctive Syllogism, along with their tautological forms and applications in evaluating the validity of arguments.

Uploaded by

elfavenir
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 38

Rules of Inference

ALMON AND BAGTIKAN


01
describe the different rules of
inference
Learning
Outcomes 02
determine the validity of arguments
using the rules of inference via two-
column proof
Let's recall...

Negation: This is formed when a given proposition is


negated. Given a proposition 𝑝, its negation is given by
~𝑝.
Let's recall...

Conjunction: The conjunction of the simple


propositions 𝑝 and 𝑞 is the compound proposition 𝑝 ∧ 𝑞,
which we read as ‘𝑝 and 𝑞’.
Let's recall...

Disjunction: This is a compound proposition in which


two or more simple propositions are joined together by
the connective ‘or’. In symbols, if 𝑝 and 𝑞 are simple
propositions, then 𝑝 ∨ 𝑞, read as ‘𝑝 or 𝑞’, is a disjunction.
Let's recall...

Conditional: If 𝑝 and 𝑞 are any two propositions, then


the statement 𝑝 → 𝑞 read as ‘If 𝑝, then 𝑞’ or ‘𝑝 implies 𝑞’ is
a conditional statement.
Let's recall...

Biconditional: A statement in the form “𝑝 if and only if


𝑞”, in the form 𝑝 ↔ 𝑞, is a biconditional statement.
Let's recall...

An argument is a positive declaration (or assertion) that


a given set of propositions 𝑃! , 𝑃" , 𝑃# , … , 𝑃$ called as
premises, leads to another proposition 𝑄, called the
conclusion.
Let's recall...

An argument can also be written in its tautological form


𝑃! , 𝑃" , 𝑃# , … , 𝑃$ ⊢ 𝑄 or 𝑃! ∧ 𝑃" ∧ 𝑃# ∧ ⋯ ∧ 𝑃$ ⊢ 𝑄
or as
𝑃!
𝑃"

𝑃$
𝑄
Algebra of Propositions
Activity
Let's write!
01 𝑝: 3+5=9 𝑟: Our Math teacher is kind.
𝑞: The moon is blue s: Math is fun

a Our Math teacher is kind if and only if the moon is blue


and 3 + 5 = 9
b If 3 + 5 = 9, then the moon is blue
c If math is fun, then the moon is not blue or our math
teacher is not kind
Let's remember!
02 Given the compound proposition 𝑝 ∨ 𝑞 : if we
know 𝑝 to be true, what is the truth value of 𝑝 ∨ 𝑞?

03 If we know 𝑝 ∧ 𝑞 to be true, what is the truth value


of 𝑝? How about the truth value of 𝑞?
Let's remember!
04 Given the compound proposition 𝑝 → 𝑞 : if we
know that 𝑝 is true, what must the truth value of 𝑞
be so that the implication is true?
Analysis
01 If any proposition 𝑝 is true, will the disjunction 𝑝 ∨
𝑎𝑛𝑦 𝑜𝑡ℎ𝑒𝑟 𝑝𝑟𝑜𝑝𝑜𝑠𝑖𝑡𝑖𝑜𝑛 always be true? Why so?

02 If the conjunction 𝑝 ∧ 𝑞 is true, will 𝑝 and 𝑞 also be


true? Why so?

03 If the proposition 𝑝 → 𝑞 is true and 𝑝 is true, will our


conclusion always be true? Why so?
Rules of Inference
Let's define

The rules of inference are rules that can be used to


derive new statements from existing statements. These
are the basic tools for constructing valid arguments and
establishing truths.
Remember!

An argument is valid when the conclusion is true


whenever all premises are true. So, in studying these
rules, we assume the premises to be true.
Rules of Inference
Name of Rule Rule of Inference Tautological Form
𝒑
Addition ∴𝒑∨𝒒 𝒑 ⊢ (𝒑 ∨ 𝒒)

𝒑∧𝒒
Simplification (𝒑 ∧ 𝒒) ⊢ 𝒑
∴𝒑
𝒑∧𝒒
(𝒑 ∧ 𝒒) ⊢ 𝒒
∴𝒒
𝒑
Conjunction 𝒒 𝒑, 𝒒 ⊢ (𝒑 ∧ 𝒒)
∴𝒑∧𝒒
Addition
𝒑
∴𝒑∨𝒒

Example: UP is a state university. Therefore, UP is either


a state university or a for-profit institution.
Simplification
𝒑∧𝒒 𝒑∧𝒒
∴𝒑 ∴𝒒

Example: December is the 12th month of the year and it


has 31 days. Therefore, December is the 12th month of
the year.
Conjunction
𝒑
𝒒
∴𝒑∧𝒒

Example: I passed my math exam. I got a phone for my


birthday. Therefore, I passed my math exam and got a
phone for my birthday.
Rules of Inference
Name of Rule Rule of Inference Tautological Form
𝒑→𝒒
Modus Ponens 𝒑 𝒑 → 𝒒 ,𝒑 ⊢ 𝒒
∴𝒒
𝒑→𝒒
Modus Tollens ~𝒒 𝒑 → 𝒒 , ~𝒒 ⊢ ~𝒑
∴ ~𝒑

Hypothetical 𝒑→𝒒
𝒒→𝒓 𝒑 → 𝒒, 𝒒 → 𝒓 ⊢ 𝒑 → 𝒓
Syllogism
∴𝒑→𝒓
Modus Ponens
Also called Law of Detachment.
𝒑→𝒒
𝒑
∴𝒒
Example: If my standing in math is less than 50%, then I
will fail math. My standing is less than 50%. Therefore, I
will fail math.
Modus Tollens
Also called Law of Contraposition.
𝒑→𝒒
~𝒒
∴ ~𝒑
Example: If I voted in the last elections, then I am over
18 years old. I am not over 18 years old. Therefore, I did
not vote in the last elections.
Hypothetical Syllogism Truth Table
𝑝 𝑞 𝑟 𝑝→𝑞 𝑞→𝑟 (𝑝 → 𝑞) ∧ 𝑞 → 𝑟 𝑝→𝑟 HS
T T T T T T T T
T T F T F F F T
T F T F T F T T
T F F F T F F T
F T T T T T T T
F T F T F F T T
F F T T T T T T
F F F T T T T T
Rules of Inference
Name of Rule Rule of Inference Tautological Form

Disjunctive 𝒑∨𝒒
~𝒑 𝒑 ∨ 𝒒, ~𝒑 ⊢ 𝒒
Syllogism
∴𝒒
𝒑∨𝒒
𝒑 ∨ 𝒒, ~𝒒 ⊢ 𝒑
~𝒒
∴𝒑
Disjunctive Syllogism
𝒑∨𝒒 𝒑∨𝒒
~𝒑 ~𝒒
∴𝒒 ∴𝒑
Example: Coffee must either be served hot or cold. It
was not served cold. Therefore, it was served hot..
Application
EXAMPLE A1 Determine the validity of the following
argument:

If Eric studies for his exam, then he will pass Math 101.
If Eric does not study for his exam, then he watched a movie
and he was out partying.
Eric did not pass Math 101.
Therefore, Eric was out partying.
EXAMPLE A2 Determine the validity of the following
argument:

𝒑∧𝒒
𝒑→~ 𝒒∧𝒓
𝒔→𝒓
∴ ~𝒔
Summary
Evaluation
01
describe the different rules of
inference
Learning
Outcomes 02
determine the validity of arguments
using the rules of inference via two-
column proof
Evaluation
THANK YOU!

You might also like