Engineering Mathematics · Propositional and First-Order Logic
Official IIT answer key · IIT Madras · Audited Aug 2026
GATE CSE 2011 Q30 · MCQ · 2 marks
Key concept
No account needed
Sit 5 related Propositional and First-Order LogicPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
Across the provided GATE CS exam papers (2012–2026), Propositional and First-Order Logic is tested through two major avenues: formalizing natural language statements into first-order logic (FOL) expressions and analyzing algebraic/truth properties of propositional and predicate formulas (tautology checking, equivalence, and operator properties). Questions frequently test quantifier negation, conditional equivalences, and formal representations of existence, uniqueness, and contrapositives. The topic is evenly balanced between 1-mark conceptual items and 2-mark algebraic simplification or multi-quantifier questions.
Full Propositional and First-Order Logic guide →Which one of the following options is CORRECT given three positive integers x, y and z, and a predicate P(x) = eg (x = 1) y (( z (x = y * z)) (y = x) (y = 1))
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.
