Disjunctive Syllogism - Discrete Mathematics - Lecture Slides, Slides of Discrete Mathematics

During the study of discrete mathematics, I found this course very informative and applicable.The main points in these lecture slides are:Disjunctive Syllogism, Proofs Simplification, Inference Rule, Tautology, Hypothetical Syllogism, Modus Ponens, Contrapositive, Direct Proofs, Proof Techniques, Valid Arguments, Proofs Fallacies, Denying Hypothesis

Typology: Slides

2012/2013

Uploaded on 04/27/2013

aslesha
aslesha 🇮🇳

4.4

(14)

160 documents

1 / 13

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS173
Discrete Mathematical Structures
Docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd

Partial preview of the text

Download Disjunctive Syllogism - Discrete Mathematics - Lecture Slides and more Slides Discrete Mathematics in PDF only on Docsity!

Discrete Mathematical Structures

Proofs - Simplification

I am not a great skater and you are sleepy.

∴ you are sleepy.

4/20/

p ∧ q

∴ p

Tautology:

(p ∧ q) → p

Inference Rule: Simplification

Proofs - Hypothetical Syllogism

If you are an athlete, you are always hungry. If you are always hungry, you have a snickers in your backpack. ∴ If you are an athlete, you have a snickers in your backpack.

4/20/

p → q q → r

∴ p → r

Tautology:

((p → q) ∧ (q → r)) → (p → r)

Inference Rule: Hypothetical Syllogism

Proofs - A little quiz…

Amy is a computer science major.

∴ Amy is a math major or a computer science major.

4/20/

Addition

If Ernie is a math major then Ernie is geeky. Ernie is not geeky!

∴ Ernie is not a math major. Modus Tollens

Proofs - A little proof…

  1. M ∨ C Given
  2. ¬D → ¬C Given
  3. D → S Given
  4. ¬M Given

4/20/

5. C DS (1,4)

6. D MT (2,5)

7. S MP (3,6)

Ellen is smart!

Proofs - A little proof…

  1. M ∨ C Given
  2. ¬D → ¬C Given
  3. D → S Given
  4. ¬M Given

4/20/

  1. C Disjunctive Syllogism (1,4)
  2. C → D Contrapositive of 2
  3. C → S Hypothetical Syllogism (6,3)
  4. S Modus Ponens (5,7)

Ellen is smart!

Proof Techniques - direct proofs

A totally different example: Prove that if n = 3 mod 4, then n 2 = 1 mod 4.

4/20/

If n = 3 mod 4, then n = 4k + 3 for some int k.

But then, (^) n 2 = (4k + 3)(4k + 3)

= 16k 2 + 24k + 9 = 16k 2 + 24k + 8 + 1 = 4(4k 2 + 6k + 2) + 1 = 4j + 1 for some int j = 1 mod 4.

Proofs - Fallacies

Rules of inference, appropriately applied give

valid arguments.

Mistakes in applying rules of inference are

called fallacies.

4/20/2013 Docsity.com

Proofs - valid arg or fallacy?

4/20/

If it rains then it is cloudy. It does not rain.

∴ It is not cloudy February!

If it is a car, then it has 4 wheels.

It is not a car.

∴ It doesn’t have 4 wheels. ATV

Denying the hypothesis.

((p → q) ∧ ¬p) → ¬q Not a tautology.