GATE DA 2025 Set 1 — Question 15

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MCQ+1 / -0.33EasyLogical EquivalencePropositional LogicArtificial Intelligence

Artificial Intelligence → Propositional Logic → Logical Equivalence

Last updated

Question

Let pp and qq be any two propositions. Consider the following propositional statements.
S1:pq,S2:¬pq,S3:¬pq,S4:¬p¬q,S_1 : p \rightarrow q, S_2 : \neg p \wedge q, S_3 : \neg p \vee q, S_4 : \neg p \vee \neg q,
where \wedge denotes conjunction (AND operation), \vee denotes disjunction (OR operation), and ¬\neg denotes negation (NOT operation). Which one of the following options is correct?
(Note: \equiv denotes logical equivalence)
Your answer

Choose one option, then check your answer.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE DA question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Propositional Logic