Scribd
Upload
43 views22 pages

Rules of Inference in Discrete Math

The document discusses the use of rules of inference to build logical arguments and highlights the importance of proofs in mathematics and computer science. It covers various methods of proof, including direct proofs, proofs by contraposition, and proofs by contradiction, while also addressing common fallacies. Understanding these techniques is essential for verifying the correctness of mathematical statements and applications in computer science.

Uploaded by

Eren Yeager
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
43 views22 pages

Rules of Inference in Discrete Math

The document discusses the use of rules of inference to build logical arguments and highlights the importance of proofs in mathematics and computer science. It covers various methods of proof, including direct proofs, proofs by contraposition, and proofs by contradiction, while also addressing common fallacies. Understanding these techniques is essential for verifying the correctness of mathematical statements and applications in computer science.

Uploaded by

Eren Yeager
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

MAT103

Discrete
Mathematics
Mary Ann Ritzell P. Vega, Ph.D.
Department of Mathematics and Statistics

CSM, MSU-IIT
Using Rules of Inference to Build Arguments
Using Rules of Inference to Build Arguments
This argument shows that the premises lead to the desired conclusion.
Step Reason
1. p → q Premise
2. ¬q → ¬p Contrapositive of (1)
3. ¬p → r Premise
4. ¬q → r Hypothetical syllogism using (2) and (3)
5. r → s Premise
6. ¬q → s Hypothetical syllogism using (4) and (5)
Fallacies
Fallacies
The proposition ((p → q) ∧ ¬p) → ¬q is not a tautology, because it is false when p is
false and q is true. Many incorrect arguments use this incorrectly as a rule of inference.
This type of incorrect reasoning is called the fallacy of denying the hypothesis.
Rules of Inference for Quantified Statements
Rules of Inference for Quantified Statements
Rules of Inference for Quantified Statements
Introduction to Proofs

A proof is a valid argument that establishes the truth of a mathematical


statement.
The methods of proof that we are going to discuss are important not only
because they are used to prove mathematical theorems, but also for their many
applications to computer science. These applications include verifying that
computer programs are correct, establishing that operating systems are secure,
making inferences in artificial intelligence, showing that system specifications are
consistent, and so on. Consequently, understanding the techniques used in proofs
is essential both in mathematics and in computer science.
Methods of Proof

Direct Proofs
A direct proof of a conditional statement p → q is constructed when the first
step is the assumption that p is true; subsequent steps are constructed using
definitions, axioms, previously proven theorems, together with rules of
inference, with the final step showing that q must also be true.
Methods of Proof : Direct Proof
Indirect Proof: Proof by Contraposition
Proof by Contraposition
VACUOUS AND TRIVIAL PROOFS
VACUOUS AND TRIVIAL PROOFS
VACUOUS AND TRIVIAL PROOFS
VACUOUS AND TRIVIAL PROOFS
Proofs by Contradiction

Suppose we want to prove that a statement p is true. Furthermore, suppose that


we can find a contradiction q such that ¬p → q is true.
Because q is false, but ¬p → q is true, we can conclude that ¬p is false, which
means that p is true.
End of Unit 1 Section 5

You might also like