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

Correct : c

Similar Questions

In a room there are only two types of people, namely Type 1 and Type 2. Type 1 people always tell the truth and Type 2 people always lie. You give a fair coin t...
#27 MCQ
Let # be a binary operator defined as X # Y = X′ + Y′ where X and Y are Boolean variables. Consider the following two statements. S1: (P # Q) # R = P # (Q # R)...
#40 MCQ
Consider the following two statements. S1: If a candidate is known to be corrupt, then he will not be elected. S2: If a candidate is kind, he will be elected....
#56 MCQ

Related Topics

predicate logic GATE 2020 computer science gate logical equivalence quantifiers predicate implication predicate computer science gate questions GATE 2020 Computer Science valid predicate formula invalid predicate formula GATE

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: