Centurion Institute of Technology & Management

DISCRETE MATHEMATICAL STRUCTURE

Santosh Kumar Bhal

Assistant Professor
CUTM Campus, Alluri Nagar, Gajapati
Introduction to Nested Quantifiers:
Two quantifiers are said to be nested if one is within the scope of the other.
For example
Here is within the scope of .
Note: Anything within a scope of the quantifier can be thought of as a
propositional function.
Then we can write
Different combination of Nested Quantifiers:

Order of first and last quantifiers does not matter.

For middle 2, order of quantifiers does matter.
i.e.
Ex. Let and be the real numbers and denotes ‘’’’. Find the truth values of
•
•
• ,
Negating Nested Quantifiers:
Ex. What is the negation of and .
Solution: and
Ex. Express the negation of the statement

Solution:
Ex: Consider the following statement
‘’ Every student in the university has studied discrete mathematics’’
Domain: All student of university
has studied discrete mathematics
‘’Every students in the university has studied discrete mathematics’’ is
equivalent to .
What is the negation of the above statement?
‘’It is not the case that every student in the university has studied discrete
mathematics’’
Or
‘’There is some students in the university who has not studied discrete
mathematics’’
: has studied discrete mathematics
: has not studied discrete mathematics
‘’There is some students in the university who has not studied discrete
mathematics’’ is equivalent to .
So the negation of
Ex: Consider the following statement
‘’ There is a student in the university who has studied discrete
mathematics’’
Domain: All student of university
has studied discrete mathematics
‘’There is a student in the university who has studied discrete
mathematics’’ is equivalent to .
What is the negation of the above statement?
‘’It is not the case that there is a student in the university who has not studied
discrete mathematics’’ is equivalent to
Or
‘’Every students in the university has not studied discrete mathematics’’ is
equivalent to
‘So the negation of .
Ex: What is the negation of the statements
‘’All dogs bark’’
‘’Most cars are inexpensive’’
Ex: What is the negation of the statements
‘’All dogs bark’’
Solutions: All dogs bark
: d barks

dogs ,
dogs ,
Some dogs do not bark
Ex: What is the negation of the statements
‘’Most cars are inexpensive’’
Solutions: ’Most cars are inexpensive’’
cars c,
cars c,

Not all cars are inexpensive

Write the negation of the following statements:
• Every day I bring lunch to work
• Cheaters never prosper
• Some people are born lucky
Expressing quantification in English:

Ex: Let be the statement ‘’ spends more than five hours every weekday in class’’
where the domain consists of all students.
Express in English.
Ex: Let be the statement ‘’ has visited North Korea’’ where the domain consists of
the students in your school.
Express in English
Ex: What is the truth value of , where is the statement ‘’’’ and the universe of
discourse consist of the positive integers not exceeding 4.
Note:

Ex: Let be the statement ‘’.’’ If the domain consists of integers. What is
the truth value of .
Ex: Let be the statement ‘’.’’ If the domain consists of integers. What is the truth
value of .
Logical Equivalences involving predicates and quantifiers:
Two logical statements involving predicates and quantifiers are said to be
equivalent if and only if they have the same truth value in all possible cases.
There are two important equivalences involving quantifiers.
Translating English sentences to logical expression:
‘’Every student in the university has studied discrete mathematics’’
Rewrite the statement so that we can identify the appropriate quantifiers to use.
‘’For every student in the university, has studied discrete mathematics.’’
Let us suppose that domain consists of all student of university.
denotes ‘’ has studied discrete mathematics’’

Note: We can also use a different domain of discourse and a set of predicates to
form the equivalent logical expression of the above statement.
Domain: All people on the planet Earth
We need to express our statement as
‘’For every person , if person is a student in the university then has studied discrete
mathematics.
Let us suppose that
: Person is a student in the university
: Person has studied discrete mathematics
Translate the following into logical expression:
‘’Some students in university has studied discrete mathematics’’
Domain: All students of university
: has studied discrete mathematics

Let us change the domain

Domain: All people on the planet Earth
: has studied discrete mathematics
: is a student of university
Rules of Inference for Quantified Statements:
Rule 1:Universal Instantiation
This rule is used to conclude that is true when is true.

--------------------------------
Rule 2: Universal Generalization
This rule states that is true, given the premise, is true for an arbitrary .

-----------------------------------

In other words, if holds for any arbitrary element , then we can conclude .
Rule 3: Existential Instantiation
This rule allows us to conclude that there is some element for which is true
when is true.

-------------------------

In other words, if holds for some element of the universe, then we can give
that element a name such as . We have to select for which is true. cannot be
arbitrary.
Rule 4: Existential Generalization
This rule states that is true when for a particular element , is true. If we know
for some element in the domain, is true.

--------------------------------------------
Ex: Determine whether the argument
‘’All students in this class understand logic’’
‘’David is a student in this class’’
Therefore, David understands logic, is correct or not.
Solution: Let us assume that
: is a student in this class
: understands logic

By the law of Instantiation

By modus ponense
This is a valid argument
Ex: Justify that if and is true, where the domain of all quantities are same.
Solution: Let c be some arbitrary element
1. premise
2. premise
3. universal instantiation
4. universal instantiation
5. Hypothetical syllogism
6. . universal generalisation