INFERENCE AND
PROVING
P R E P A R E D B Y : L U I S M E I N G
OBJECTIVES:
01 Definition
02 Arguments
03 Proving
1.1 Definition
Arguments
a list of propositions, one is the
conclusion and the others are premises
or assumptions
1.1 Definition
Arguments
1.1 Definition
Deductive Reasoning
creating a conclusion from a sequence of
propositions
1.1 Definition
Arguments
example:
1.1 Definition
Arguments
example:
2.1 Arguments
Using Truth Tables to
Analyze Arguments
1: Symbolize each premise and the
conclusion.
2: Make a truth table that has a column for
each premise and a column for the
conclusion.
2.1 Arguments
Using Truth Tables to
Analyze Arguments
3: If the truth table has a row where the
conclusion column is FALSE while every
premise column is TRUE, then the argument
is INVALID. Otherwise, the argument is VALID.
2.1 Arguments
Using Truth Tables to
Analyze Arguments
* An argument is INVALID if and only if it is
logically possible for the conclusion to be
false even though every premise is assumed
to be true
2.1 Arguments
Using Truth Tables to
Analyze Arguments
example:
p -> (q V r)
~q
___________________
∴ p -> r
2.1 Arguments
2.1 Arguments
Tautologies
is a statement form that is always true
regardless of the truth values of the
individual statements substituted for its
statement variables
Example: p v ~p
2.1 Arguments
Tautologies
Example: I will study harder or I will not
study harder.
2.1 Arguments
Contradictions
is a statement form that is always false
regardless of the truth values of the
individual statements substituted for its
statement variables
Example: p ^ ~p
2.1 Arguments
Contradictions
Example: I will study harder and I will not
study harder.
2.1 Arguments
Logically Equivalent
two statements are called logically
equivalent if, and only if, they have
identical truth values for each possible
substitution
2.1 Arguments
Logically Equivalent
2.1 Arguments
2.1 Arguments
2.1 Arguments
Logically Equivalent
Example:
If you listen you will hear what I’m saying
You are listening
Therefore, you hear what I am saying
2.1 Arguments
Logically Equivalent
Let p represent the
statement “you listen”
Let q represent the
statement “you hear what
I am saying”
3.1 Proving
3.1 Proving
Modus Ponens
3.1 Proving
Modus Ponens
Example:
Let p be “It is snowing.”
Let q be “I will study discrete math.”
3.1 Proving
Modus Ponens
“If it is snowing, then I will study discrete
math.”
“It is snowing.”
“Therefore , I will study discrete math.”
3.1 Proving
Modus Tollens
3.1 Proving
Modus Tollens
Example:
Let p be “It is snowing.”
Let q be “I will study discrete math.”
3.1 Proving
Modus Tollens
“If it is snowing, then I will study discrete
math.”
“I will not study discrete math.”
“Therefore , it is not snowing.”
3.1 Proving
Hypothetical Syllogism/
Transitive Law
3.1 Proving
Hypothetical Syllogism
Example:
Let p be “it snows.”
Let q be “I will study discrete math.”
Let r be “I will get an A.”
3.1 Proving
Hypothetical Syllogism
“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.”
3.1 Proving
Disjunctive Syllogism
3.1 Proving
Disjunctive Syllogism
Example:
Let p be “I will study discrete math.”
Let q be “I will study English literature.”
3.1 Proving
Disjunctive Syllogism
“I will study discrete math or I will study
English literature.”
“I will not study discrete math.”
“Therefore , I will study English literature.”
3.1 Proving
Addition
3.1 Proving
Addition
Example:
Let p be “I will study discrete math.”
Let q be “I will visit Las Vegas.”
3.1 Proving
Addition
“I will study discrete math.”
“Therefore, I will study discrete math or I will
visit Las Vegas.”
3.1 Proving
Simplification
3.1 Proving
Simplification
Example:
Let p be “I will study discrete math.”
Let q be “I will study English literature.”
3.1 Proving
Simplification
“I will study discrete math and English
literature”
“Therefore, I will study discrete math.”
3.1 Proving
Conjunction
3.1 Proving
Conjunction
Example:
Let p be “I will study discrete math.”
Let q be “I will study English literature.”
3.1 Proving
Conjunction
“I will study discrete math.”
“I will study English literature.”
“Therefore, I will study discrete math and I
will study English literature.”
3.1 Proving
Resolution
3.1 Proving
Resolution
Example:
Let p be “I will study discrete math.”
Let r be “I will study English literature.”
Let q be “I will study databases.”
3.1 Proving
Resolution
“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
study English literature.”
3.2 Mathematical Proof
Mathematical Proof
is an argument showing that the stated
premises logically guarantee the
conclusion
3.2 Mathematical Proof
Mathematical Proof
you can also use it to
prove the validity of
an argument
3.2 Mathematical Proof
3.2 Mathematical Proof
3.2 Mathematical Proof
3.2 Mathematical Proof
