Computer Sciences > Gate 2020 > Propositional Logic
Which one of the following predicate formulae is NOT logically valid ? Note that W is a predicate formula without any free occurrence of x.
A
∀x(p(x) ∨ W) ≡ ∀x(px) ∨ W
B
∃x(p(x) ∧ W) ≡ ∃xp(x) ∧ W
C
∀x(p(x) → W) ≡ ∀xp(x) → W
D
∃x(p(x) → W) ≡ ∀xp(x) → W

Explanation

Correct : c

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science