Prerequisite : Predicates and Quantifiers Set 1, Propositional Equivalences
Logical Equivalences involving Quantifiers
Two logical statements involving predicates and quantifiers are considered equivalent if and only if they have the same truth value no matter which predicates are substituted into these statements irrespective of the domain used for the variables in the propositions.
There are two very important equivalences involving quantifiers, given below-
One is compelled to think whether the equivalences would hold if the conjunction is replaced with disjunction in (1) and disjunction is replaced with the conjunction in (2). The answer may seem like Yes, but on second thought, you would realize that the answer is No.
To prove why they are not equivalent, we must understand what makes two statements equivalent. As explained in the previous article Propositional Equivalences two statements and are equivalent if-
, which can also be restated as .
If they are equivalent then,
both must be true.
Let us first check for .
Proof – Suppose that the Hypothesis is true. That means there are certain for which is true and others where is true.
It is also possible that for some both and are true. But in any case, all must either satisfy or or both, since the hypothesis is true.
The conclusion(RHS) is true when the disjunction is true. As is clear from the above reasoning that is true for some values of and for some.
Thus both and are false, since neither of them are true for all values of .
In the case where and hold for all then this equivalence is true, but otherwise it is false.
So, . According to our assumption, the hypothesis is true, but our conclusion turned out to be false. This cannot be true for a conditional, therefore the conditional
Since one conditional is false, the complete biconditional is false.
In a similar way, it can also be proved that,
As an exercise prove the above non-equivalence and also the equivalences involving quantifiers stated above. Remember to prove the bi-conditional and not just one conditional.
Negating Quantified statements
Consider the statement “Every Computer Science Graduate has taken a course in Discrete Mathematics.”
The above statement is a universal quantification,
where is the statement “x has taken a course in Discrete Mathematics” and the domain of is all Computer Science Graduates.
The negation of this statement is “It is not the case that every computer science graduate has taken a course in Discrete Mathematics” or simply “There is a computer science graduate who has not taken a course in Discrete Mathematics”.
The above statement can be expressed using an existential quantification.
Thus, we get the following logical equivalence-
These equivalences are nothing but rules for negations of quantifiers. They are also known as De Morgans’s laws for quantifiers.
It is possible to use two quantifiers such that one quantifier is within the scope of the other one. In such cases the quantifiers are said to be nested.
The above statement is read as “For all , there exists a such that .
Note: The relative order in which the quantifiers are placed is important unless all the quantifiers are of the same kind i.e. all are universal quantifiers or all are existential quantifiers.
GATE CS Corner Questions
Practicing the following questions will help you test your knowledge. All questions have been asked in GATE in previous years or in GATE Mock Tests. It is highly recommended that you practice them.
1. GATE CS 2012, Question 17
2. GATE CS 2013, Question 27
3. GATE CS 2013, Question 47
4. GATE CS 2010, Question 30
5. GATE CS 2009, Question 26
6. GATE CS 2005, Question 36
7. GATE CS 2016 Set-2, Question 37
Majority of the questions asked in GATE from Discrete Mathematics focus on Predicate Logic. Almost all of them involve quantifiers.
This article is contributed by Chirag Manwani. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.