GATE CS 2020 | Question: 39
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)≡∀xp(x)∨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
Ans: C
0:00 Question
0:17 Solution
----------------------------------------------------
📗👩🏫Math Lecture for GATE CS • Mathematics Lectures for GATE CSE by Monal...
❓🙋♀️Math GATE PYQ : • Mathematics GATE CS/DA PYQ (2010-2025) sol...
----------------------------------------------
❓🙋♀️GATE General Aptitude (GA) solved by Monalisa • General Aptitude PYQ solved by Monalisa Pr...
----------------------------------------------------------------
📘👩🏫Algorithm Lectures : • Algorithm Lectures for GATE CSE by Monalis...
❓🙋♀️Algorithm GATE PYQ: • Algorithm GATE CS & DA PYQ(2010-2025) solv...
----------------------------------------------------------------
📙👩🏫Compiler Design Lectures : • Compiler Design Lectures for GATE Computer...
❓🙋♀️Compiler Design PYQ : • Compiler Design PYQ(2010-2025) GATE CS sol...
----------------------------------------------------------------------
📔👩🏫Theory Of Computation Lectures • TOC (Theory of Computation) Lectures for G...
❓🙋♀️TOC GATE PYQ: • TOC GATE CS PYQ (2010-2025) solved by Mona...
-------------------------------------------------------------------
📒👩🏫Data Structure Lecture: • Data Structure (DS) Lecture for GATE Compu...
❓🙋♀️Data Structure PYQ: • Data Structure GATE CS PYQ(2010-2025) Solv...
-----------------------------------------------------------------------
#gate_cs #gate #maths #mathmatics #discretemathematicsgate #discrete_mathematics #discretemathematics #gate2024 #monalisacs #logic