Scribd
Upload
89 views29 pages

The Foundations: Logic and Proofs: Chapter 1, Part III: Proofs

The document discusses rules of inference for constructing valid logical arguments. It covers propositional logic inference rules like modus ponens and disjunctive syllogism. It also covers quantified statements and rules for handling variables and quantifiers, such as universal instantiation, existential instantiation, and universal generalization. Examples are provided to demonstrate applying these rules of inference to build arguments in propositional and predicate logic.

Uploaded by

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

The Foundations: Logic and Proofs: Chapter 1, Part III: Proofs

The document discusses rules of inference for constructing valid logical arguments. It covers propositional logic inference rules like modus ponens and disjunctive syllogism. It also covers quantified statements and rules for handling variables and quantifiers, such as universal instantiation, existential instantiation, and universal generalization. Examples are provided to demonstrate applying these rules of inference to build arguments in propositional and predicate logic.

Uploaded by

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

The Foundations: Logic

and Proofs
Chapter 1, Part III: Proofs

With Question/Answer Animations


Summary
Valid Arguments and Rules of Inference
Proof Methods
Proof Strategies
Rules of Inference
Section 1.6
Section Summary
Valid Arguments
Inference Rules for Propositional Logic
Using Rules of Inference to Build Arguments
Rules of Inference for Quantified Statements
Building Arguments for Quantified Statements
Valid Arguments
 We will show how to construct valid arguments in
two stages; first for propositional logic and then for
predicate logic. The rules of inference are the
essential building block in the construction of valid
arguments.
1. Propositional Logic
Inference Rules
2. Predicate Logic
Inference rules for propositional logic plus additional inference
rules to handle variables and quantifiers.
Arguments in Propositional Logic
 A argument in propositional logic is a sequence of propositions.
All but the final proposition are called premises. The last
statement is the conclusion.
 The argument is valid if the premises imply the conclusion. An
argument form is an argument that is valid no matter what
propositions are substituted into its propositional variables.
 If the premises are p1 ,p2, …,pn and the conclusion is q then
(p1 ∧ p2 ∧ … ∧ pn ) → q is a tautology.
 Inference rules are all argument simple argument forms that will
be used to construct more complex argument forms.
Rules of Inference for Propositional
Logic: Modus Ponens
Corresponding Tautology:
(p ∧ (p →q)) → q

Example:
Let p be “It is snowing.”
Let q be “I will study discrete math.”

“If it is snowing, then I will study discrete math.”


“It is snowing.”

“Therefore , I will study discrete math.”


Modus Tollens
Corresponding Tautology:
(¬p∧(p →q))→¬q

Example:
Let p be “it is snowing.”
Let q be “I will study discrete math.”

“If it is snowing, then I will study discrete math.”


“I will not study discrete math.”

“Therefore , it is not snowing.”


Hypothetical Syllogism
Corresponding Tautology:
((p →q) ∧ (q→r))→(p→ r)

Example:
Let p be “it snows.”
Let q be “I will study discrete math.”
Let r be “I will get an A.”

“If it snows, then I will study discrete math.”


“If I study discrete math, I will get an A.”

“Therefore , If it snows, I will get an A.”


Disjunctive Syllogism
Corresponding Tautology:
(¬p∧(p ∨q))→q

Example:
Let p be “I will study discrete math.”
Let q be “I will study English literature.”

“I will study discrete math or I will study English literature.”


“I will not study discrete math.”

“Therefore , I will study English literature.”


Addition
Corresponding Tautology:
p →(p ∨q)

Example:
Let p be “I will study discrete math.”
Let q be “I will visit Las Vegas.”

“I will study discrete math.”

“Therefore, I will study discrete math or I will visit


Las Vegas.”
Simplification

Corresponding Tautology:
(p∧q) →p

Example:
Let p be “I will study discrete math.”
Let q be “I will study English literature.”

“I will study discrete math and English literature”

“Therefore, I will study discrete math.”


Conjunction
Corresponding Tautology:
((p) ∧ (q)) →(p ∧ q)

Example:
Let p be “I will study discrete math.”
Let q be “I will study English literature.”

“I will study discrete math.”


“I will study English literature.”

“Therefore, I will study discrete math and I will study


English literature.”
Resolution Resolution plays an important role
in AI and is used in Prolog.

Corresponding Tautology:
((¬p ∨ r ) ∧ (p ∨ q)) →(q ∨ r)

Example:
Let p be “I will study discrete math.”
Let r be “I will study English literature.”
Let q be “I will study databases.”

“I will not study discrete math or I will study English literature.”


“I will study discrete math or I will study databases.”

“Therefore, I will study databases or I will English literature.”


Using the Rules of Inference to Build
Valid Arguments
 A valid argument is a sequence of statements. Each statement is either
a premise or follows from previous statements by rules of inference.
The last statement is called conclusion.
 A valid argument takes the following form:
S1
S2
.
.
.
Sn

C
Valid Arguments
Example 1: From the single proposition

Show that q is a conclusion.


Solution:
Valid Arguments
Example 2:
 With these hypotheses:
“It is not sunny this afternoon and it is colder than yesterday.”
“We will go swimming only if it is sunny.”
“If we do not go swimming, then we will take a canoe trip.”
“If we take a canoe trip, then we will be home by sunset.”
 Using the inference rules, construct a valid argument for the conclusion:
“We will be home by sunset.”
Solution:
1. Choose propositional variables:
p : “It is sunny this afternoon.” r : “We will go swimming.” t : “We will be home by
sunset.”
q : “It is colder than yesterday.” s : “We will take a canoe trip.”
2. Translation into propositional logic:

Continued on next slide 


Valid Arguments
3. Construct the Valid Argument
Handling Quantified Statements
Valid arguments for quantified statements are a
sequence of statements. Each statement is either a
premise or follows from previous statements by rules
of inference which include:
 Rules of Inference for Propositional Logic
 Rules of Inference for Quantified Statements
The rules of inference for quantified statements are
introduced in the next several slides.
Universal Instantiation (UI)

Example:

Our domain consists of all dogs and Fido is a dog.

“All dogs are cuddly.”

“Therefore, Fido is cuddly.”


Universal Generalization (UG)

Used often implicitly in Mathematical Proofs.


Existential Instantiation (EI)

Example:

“There is someone who got an A in the course.”


“Let’s call her a and say that a got an A”
Existential Generalization (EG)

Example:

“Michelle got an A in the class.”


“Therefore, someone got an A in the class.”
Using Rules of Inference
Example 1: Using the rules of inference, construct a valid argument to
show that
“John Smith has two legs”
is a consequence of the premises:
“Every man has two legs.” “John Smith is a man.”
Solution: Let M(x) denote “x is a man” and L(x) “ x has two legs” and let
John Smith be a member of the domain.
Valid Argument:
Using Rules of Inference
Example 2: Use the rules of inference to construct a valid argument
showing that the conclusion
“Someone who passed the first exam has not read the book.”
follows from the premises
“A student in this class has not read the book.”
“Everyone in this class passed the first exam.”
Solution: Let C(x) denote “x is in this class,” B(x) denote “ x has read the
book,” and P(x) denote “x passed the first exam.”
First we translate the
premises and conclusion
into symbolic form.

Continued on next slide 


Using Rules of Inference
Valid Argument:
Returning to the Socrates Example
Solution for Socrates Example
Valid Argument
Universal Modus Ponens
Universal Modus Ponens combines universal
instantiation and modus ponens into one rule.

This rule could be used in the Socrates example.

You might also like