Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Propositional Function - 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:Propositional Function, Nested Quantifiers, Rules of Inference, Universe of Discourse, Quantified Predicates, Quantified Variables, Existential Quantifier, Universal Quantifier, Predicate Logic and Propositions

Typology: Slides

2012/2013

Uploaded on 04/27/2013

atasi
atasi 🇮🇳

4.6

(32)

136 documents

1 / 27

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Discrete Mathematics
CS 2610
August 21, 2008
Docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b

Partial preview of the text

Download Propositional Function - Discrete Mathematics - Lecture Slides and more Slides Discrete Mathematics in PDF only on Docsity!

Discrete Mathematics

CS 2610

August 21, 2008

2

Agenda

Nested quantifiers Rules of inference Proofs

4

Predicate Logic and Propositions

An expression with zero free variables is an actual proposition

Ex. Q(x) : x > 0, R(y): y < 10

∃ x Q(x) ∧ ∃y R(y)

5

Nested Quantifiers

When dealing with polyadic predicates, each argument may be quantified with its own quantifier. Each nested quantifier occurs in the scope of another quantifier.

Examples: (L=likes, UoD(x)=kids, UoD(y)=cars)  ∀x∀y L(x,y) reads ∀x(∀y L(x,y))  ∀x∃y L(x,y) reads ∀x(∃y L(x,y))  ∃x∀y L(x,y) reads ∃x(∀y L(x,y))  ∃x∃y L(x,y) reads ∃x(∃y L(x,y)) Another example  ∀x (P(x) ∨ ∃y R(x,y))

7

Negation of Nested Quantifiers

To negate a quantifier, move negation to the right, changing quantifiers as you go. Example:

¬∀x∃y∀z P(x,y,z) ≡∃x^ ∀y^ ∃z^ ¬P(x,y,z).

8

Proofs and inference

Assume that the following statements are true:

I have a total score over 96. If I have a total score over 96, then I get an A in the class.

What can we claim? I get an A in the class.

How do we know the claim is true? Logical Deduction.

10

Proofs: Inference Rules

An Inference Rule:

“∴” means “therefore”

premise 1
premise 2 …
∴ conclusion

11

Proofs: Modus Ponens

I have a total score over 96.

If I have a total score over 96, then I get an A for the class.

∴ I get an A for this class

p

p → q

∴ q

Tautology:

(p ∧ (p → q)) → q

13

Proofs: Addition

  • I am a student.

∴ I am a student or I am a visitor.

p

∴ p ∨ q

Tautology:

p → (p ∨ q)

14

Proofs: Simplification

  • I am a student and I am a soccer player.

∴ I am a student.

p ∧ q

∴ p

Tautology:

(p ∧ q) → p

16

Proofs: Disjunctive Syllogism

I am a student or I am a soccer player. I am a not soccer player.

∴ I am a student.

p ∨ q ¬q

∴ p

Tautology:

((p ∨ q) ∧ ¬q) → p

17

Proofs: Hypothetical Syllogism

If I get a total score over 96, I will get an A in the course. If I get an A in the course, I will have a 4.0 semester average.

∴ If I get a total score over 96 then

∴ I will have a 4.0 semester average.

p → q q → r

∴ p → r

Tautology: ((p → q) ∧ (q → r)) → (p → r)

19

Proofs: Proof by Cases

I have taken CS2610 or I have taken CS1301. If I have taken CS2610 then I can register for CS If I have taken CS1301 then I can register for CS

∴ I can register for CS

p ∨ q p → r q → r

∴ r

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

20

Fallacy of Affirming the Conclusion

  • If you have the flu then you’ll have a sore throat. You have a sore throat.

∴ You must have the flu.

Fallacy:

(q ∧ (p → q)) → p

q

p → q

∴ p

Abductive, rather than deductive reasoning!