0% found this document useful (0 votes)
12 views

Discrete Class 6-7

The document covers key concepts in discrete mathematics, focusing on logic and proofs, particularly logical equivalences involving quantifiers and nested quantifiers. It discusses how to translate statements between English and logical expressions, as well as the negation of quantified expressions. The section emphasizes the importance of understanding the scope of quantifiers in mathematical statements.

Uploaded by

tamilavatar06
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
12 views

Discrete Class 6-7

The document covers key concepts in discrete mathematics, focusing on logic and proofs, particularly logical equivalences involving quantifiers and nested quantifiers. It discusses how to translate statements between English and logical expressions, as well as the negation of quantified expressions. The section emphasizes the importance of understanding the scope of quantifiers in mathematical statements.

Uploaded by

tamilavatar06
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

Discrete MAthematics

1. Logic and Proofs


Class-6 & 7
Logical Equivalences Involving Quantifiers
Def. Statements involving predicates and quantifiers are logically equivalent if and only if they have the same truth value no
matter which predicates are substituted into these statements and which domain of discourse is used for the variables in
these propositional functions. We use the notation S ≡ T to indicate that two statements S and T involving predicates and
quantifiers are logically equivalent.
Negating Quantified Expressions
Translating from English into Logical Expressions
Using Quantifiers in System Specifications
1.5. Nested Quantifiers

In this section, nested quantifiers are discussed, wherein one quantifier operates within the scope of another, as
exemplified by:
∀x∃y(x + y = 0).

Note that everything within the scope of a quantifier can be thought of as a propositional function.
For example,
∀x∃y(x + y = 0)
is the same thing as ∀xQ(x), where Q(x) is ∃yP(x, y), where P(x, y) is x + y = 0.
Statements Involving Nested Quantifiers
Statements Involving Nested Quantifiers
Statements Involving Nested Quantifiers
Statements Involving Nested Quantifiers
Translating Mathematical Statements into Statements Involving Nested Quantifiers
Translating Mathematical Statements into Statements Involving Nested Quantifiers
Translating Mathematical Statements into Statements Involving Nested Quantifiers
Translating from Nested Quantifiers into English
Translating English Sentences into Logical Expressions
Translating English Sentences into Logical Expressions
Translating English Sentences into Logical Expressions
Negating Nested Quantifiers
Negating Nested Quantifiers
Negating Nested Quantifiers

You might also like