Question
Which one of the following predicate formulae is NOT logically valid? Note that is a predicate formula without any free occurrence of .
Official answer and solution
- Official answer
- C
- From
- Official GATE 2020 answer key
Solution
Evaluate equivalence of each predicate formula using standard quantifier distribution rules.
Given that contains no free occurrences of :
- A: . Since universal quantifier distributes over disjunction with a constant formula , this is logically valid.
- B: . Since existential quantifier distributes over conjunction with a constant formula , this is logically valid.
- D: . This is logically valid.
Analysis of Formula C:
- The correct equivalent of is , NOT .
- Counterexample: Suppose in domain , is true, is false, and is false.
- LHS: requires both (True False = False) and (False False = True) to hold. Their conjunction is False.
- RHS: . Since is False, False False evaluates to True.
- Since LHS RHS, formula C is NOT logically valid.
Final answer
C
The answer is the one in the official GATE answer key. The solution is this site's own explanation.
Source
- Paper
- GATE 2020 Computer Science and Information Technology (CS)
- Question
- 49 of 65, printed as CS Q.39
- Section
- Computer Science and Information Technology
Report an error in this question
GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.