Which one of the following predicate formulae is NOT logically valid?
Note that is a predicate formula without any free occurrence of .
- (A)
- (B)
- (C)
- (D)
Which one of the following predicate formulae is NOT logically valid?
Note that is a predicate formula without any free occurrence of .
ANSWER
The formula that is not logically valid is option (C).
Official answer: CSource: Official answer key, GATE 2020 CS (IIT Delhi)
Since does not occur free in , a quantifier over can be moved across for and . So and . Options (A) and (B) are logically valid.
Rewrite the implication: .
Option (D): . So (D) is valid.
Option (C): . This is not equivalent to , because and differ.
Counter-model for (C): take the domain with true, false and false. Left side: is false, because at we get true false, which is false. Right side: is false, so is true. The two sides have different truth values, so the equivalence in (C) is not valid.
Hence the formula that is NOT logically valid is (C).
KEY IDEA
A quantifier moves freely across a formula in which is not free when the connective is or . Under , the quantifier flips when it passes into the antecedent: and .
WATCH OUT FOR
Pulling out of the antecedent of an implication unchanged. is not . The antecedent turns the universal quantifier into an existential one.
From the GATE 2020 CS paper. Every question of this paper · Download the full paper · All 7 Mathematical logic questions, with notes