Propositional Logic and Logical Equivalence Practice Questions for GATE DA

Solve 167+ Propositional Logic and Logical Equivalence practice questions for GATE DA with answers and detailed solutions. Free sample questions below.

Chapter Roadmap: Propositional Logic

Chapter Journey: Propositional Logic

Step 1: The Language of Logic

Translating English to Propositional Logic
Conditional and Biconditional Statements
Understanding Necessary vs. Sufficient Conditions

Step 2: The Mechanics of Truth

Truth Tables and Tautologies
Logical Equivalence and Algebraic Simplification
Fundamental Laws of Logic (De Morgan's, Contrapositive)

Step 3: Exam Mastery

Decoding Complex Word Problems
Identifying Equivalent Propositions Quickly
Avoiding Common Logical Fallacies

The Core of Logical Reasoning

What is Propositional Logic?
Propositional logic is the study of propositions (declarative statements that are either True or False) and how they combine using logical connectives.

Symbol	Name	Meaning
$\land$	Conjunction	AND (Both must be true)
$\lor$	Disjunction	OR (At least one must be true)
$\neg$	Negation	NOT (Flips the truth value)
$\to$	Implication	IMPLIES (If... then...)
$⟺$	Biconditional	IF AND ONLY IF (Same truth value)

The Goal:
To take messy, ambiguous English sentences, convert them into precise symbolic logic, and use mathematical rules to determine their truth values or simplify them.

Propositional Logic and Logical Equivalence: Solved Questions with Step-by-Step Explanations (10 Problems)

Question 1 · Analytical Aptitude MCQ

Which one of the following propositions is logically equivalent to $p \to \neg q$ by the law of material implication?

A.
$

eg p \lor

eg q$
B.
$

eg p \land q$
C.
$p \lor

eg q$
D.
$p \land

eg q$

Correct Answer:

Step-by-Step Solution

Key idea: The law of material implication states that $A \to B \equiv \neg A \lor B$ .

Step 1: Identify the components of the given conditional: $A = p$ and $B = \neg q$ .

Step 2: Apply the material implication rule: $p \to \neg q \equiv \neg p \lor \neg q$ .

Step 3: This matches Option A exactly.

Answer: Option A.

Question 2 · Analytical Aptitude MCQ

Which one of the following propositions is logically equivalent to $\neg p \to q$ by the law of material implication?

A.
$\neg p \lor q$
B.
$p \land q$
C.
$p \lor q$
D.
$\neg p \land \neg q$

Correct Answer:

Step-by-Step Solution

Key idea: The law of material implication states that $A \to B \equiv \neg A \lor B$ .

Step 1: Identify the components of the given conditional: $A = \neg p$ and $B = q$ .

Step 2: Apply the material implication rule: $\neg p \to q \equiv \neg (\neg p) \lor q$ .

Step 3: Simplify the double negation: $\neg (\neg p) \equiv p$ .

Step 4: The final expression is $p \lor q$ .

Answer: Option C.

Question 3 · Analytical Aptitude MCQ

When fully simplifying the proposition $\neg (p \land \neg q)$ using fundamental logical equivalences, which of the following is an IMPOSSIBLE final result?

A.
$\neg p \lor q$
B.
$p \to q$
C.
$q \lor \neg p$
D.
$\neg p \land q$

Correct Answer:

Step-by-Step Solution

Key idea: Apply De Morgan's Law and material implication to simplify $\neg (p \land \neg q)$ .

Step 1: Apply De Morgan's Law to the negation: $\neg (p \land \neg q) \equiv \neg p \lor \neg (\neg q) \equiv \neg p \lor q$ .

Step 2: Recognize that $\neg p \lor q$ is the material implication form of $p \to q$ .

Step 3: By commutativity of OR, $\neg p \lor q \equiv q \lor \neg p$ .

Step 4: The form $\neg p \land q$ is the negation of $p \to q$ (i.e., $\neg (p \to q)$ ), not an equivalent form. Thus, it is an impossible final result.

Answer: D

Question 4 · Analytical Aptitude MCQ

Consider the following statements about propositional variables $x$ and $y$ :

S1: $x \to y$ is logically equivalent to $\neg x \to \neg y$ .

S2: $\neg (x \land y)$ is logically equivalent to $\neg x \lor \neg y$ .

S3: $x \lor y$ is logically equivalent to $\neg (\neg x \land \neg y)$ .

Which of the following options is correct?

A.
Only S1 is TRUE
B.
Only S2 and S3 are TRUE
C.
Only S1 and S2 are TRUE
D.
All S1, S2, and S3 are TRUE

Correct Answer:

Step-by-Step Solution

Key idea: Use fundamental logical equivalences to verify each statement.

Step 1: S1 claims $x \to y \equiv \neg x \to \neg y$ . This is the inverse fallacy. The contrapositive is $\neg y \to \neg x$ , not the inverse. So S1 is FALSE.

Step 2: S2 claims $\neg (x \land y) \equiv \neg x \lor \neg y$ . This is exactly De Morgan's Law. So S2 is TRUE.

Step 3: S3 claims $x \lor y \equiv \neg (\neg x \land \neg y)$ . Applying De Morgan's to the right side gives $\neg (\neg x) \lor \neg (\neg y) \equiv x \lor y$ . So S3 is TRUE.

Step 4: Only S2 and S3 are TRUE.

Answer: B

Question 5 · Analytical Aptitude MCQ

When fully simplifying the proposition $\neg (p \to q)$ using fundamental logical equivalences, which of the following is an IMPOSSIBLE final result?

A.
$p \land \neg q$
B.
$\neg q \land p$
C.
$p \to q$
D.
$\neg (\neg p \lor q)$

Correct Answer:

Step-by-Step Solution

Key idea: Apply material implication and De Morgan's Law to simplify $\neg (p \to q)$ .

Step 1: Convert the conditional to material implication: $p \to q \equiv \neg p \lor q$ . Thus, $\neg (p \to q) \equiv \neg (\neg p \lor q)$ . This matches option (D).

Step 2: Apply De Morgan's Law: $\neg (\neg p \lor q) \equiv \neg (\neg p) \land \neg q \equiv p \land \neg q$ . This matches option (A).

Step 3: By commutativity of AND, $p \land \neg q \equiv \neg q \land p$ . This matches option (B).

Step 4: The form $p \to q$ is equivalent to $\neg p \lor q$ , which is the exact opposite of the simplified expression. Thus, it is an impossible final result.

Answer: C

Question 6 · Analytical Aptitude MCQ

Consider the following statements about propositional variables $p$ and $q$ :

S1: $p \to q$ is logically equivalent to $\neg p \lor q$ .

S2: $\neg (p \land q)$ is logically equivalent to $\neg p \land \neg q$ .

S3: $p ⟺ q$ is logically equivalent to $(p \to q) \land (q \to p)$ .

Which of the following options is correct?

A.
Only S1 and S2 are TRUE
B.
Only S1 and S3 are TRUE
C.
Only S2 and S3 are TRUE
D.
All S1, S2, and S3 are TRUE

Correct Answer:

Step-by-Step Solution

Key idea: Use fundamental logical equivalences to verify each statement.

Step 1: S1 claims $p \to q \equiv \neg p \lor q$ . This is the exact definition of material implication. So S1 is TRUE.

Step 2: S2 claims $\neg (p \land q) \equiv \neg p \land \neg q$ . This violates De Morgan's Law, which states $\neg (p \land q) \equiv \neg p \lor \neg q$ . So S2 is FALSE.

Step 3: S3 claims $p ⟺ q \equiv (p \to q) \land (q \to p)$ . This is the standard expansion of the biconditional. So S3 is TRUE.

Step 4: Only S1 and S3 are TRUE.

Answer: B

Question 7 · Analytical Aptitude MCQ

When fully simplifying the proposition $\neg (p \to (q \to r))$ using fundamental logical equivalences, which of the following is an IMPOSSIBLE final result?

A.
$p \land q \land \neg r$
B.
$\neg r \land q \land p$
C.
$p \land (q \land \neg r)$
D.
$p \to (q \land r)$

Correct Answer:

Step-by-Step Solution

Key idea: Apply material implication and De Morgan's Law to simplify the nested conditional.

Step 1: Convert the inner conditional: $q \to r \equiv \neg q \lor r$ .

Step 2: Convert the outer conditional: $p \to (\neg q \lor r) \equiv \neg p \lor (\neg q \lor r)$ .

Step 3: Apply negation to the entire expression: $\neg (\neg p \lor \neg q \lor r) \equiv p \land q \land \neg r$ . This matches option (A).

Step 4: By commutativity of AND, $p \land q \land \neg r \equiv \neg r \land q \land p$ . This matches option (B).

Step 5: By associativity of AND, $p \land q \land \neg r \equiv p \land (q \land \neg r)$ . This matches option (C).

Step 6: The form $p \to (q \land r)$ is equivalent to $\neg p \lor (q \land r)$ , which is not equivalent to $p \land q \land \neg r$ . Thus, it is an impossible final result.

Answer: D

Question 8 · Analytical Aptitude MCQ

Consider the following statements about propositional variables $p$ and $q$ :

S1: $p \to q$ is logically equivalent to $\neg p \lor q$ .

S2: $\neg (p \land q)$ is logically equivalent to $\neg p \land \neg q$ .

S3: $p ⟺ q$ is logically equivalent to $(p \land q) \lor (\neg p \land \neg q)$ .

Which of the following options is correct?

A.
Only S1 is TRUE
B.
Only S1 and S3 are TRUE
C.
Only S2 and S3 are TRUE
D.
All S1, S2, and S3 are TRUE

Correct Answer:

Step-by-Step Solution

Key idea: Use fundamental logical equivalences to verify each statement.

Step 1: S1 claims $p \to q \equiv \neg p \lor q$ . This is the exact definition of material implication. So S1 is TRUE.

Step 2: S2 claims $\neg (p \land q) \equiv \neg p \land \neg q$ . This violates De Morgan's Law, which states $\neg (p \land q) \equiv \neg p \lor \neg q$ . So S2 is FALSE.

Step 3: S3 claims $p ⟺ q \equiv (p \land q) \lor (\neg p \land \neg q)$ . This is the standard expansion of the biconditional (true when both are true, or both are false). So S3 is TRUE.

Step 4: Only S1 and S3 are TRUE.

Answer: B

Question 9 · Analytical Aptitude MCQ

Which one of the following propositions is logically equivalent to $p \to q$ by the law of material implication?

A.
p \lor \neg q
B.
\neg p \land q
C.
p \land \neg q
D.
\neg p \lor q

Correct Answer:

Step-by-Step Solution

Key idea: This is a direct equivalence recall question. The law of material implication provides a standard way to rewrite a conditional as a disjunction.

Step 1: Recall the material implication equivalence from the equivalence toolkit: $p \to q \equiv \neg p \lor q$ .

Step 2: The rule is: negate the premise, keep the conclusion, and change the connective from $\to$ to $\lor$ .

Step 3: Match with the options. Option D is $\neg p \lor q$ , which matches exactly.

Answer: Option D ( $\neg p \lor q$ ).

Common trap: Choosing $\neg p \lor q$ is correct, but choosing $p \lor \neg q$ (Option A) is the most common error. This mistake negates the conclusion instead of the premise. The rule is: negate the <b>premise</b> (the left side of $\to$ ), not the conclusion.

Verification: Build a quick truth table. When $p = T, q = F$ : $p \to q = F$ , and $\neg p \lor q = F \lor F = F$ . They match in all 4 rows.

Question 10 · Analytical Aptitude MCQ

Consider the following assertion and reason about translating English to propositional logic.

Assertion (A): The statement " $p$ only if $q$ " is logically equivalent to $p \to q$ .

Reason (R): In the phrase " $p$ only if $q$ ", the proposition $p$ represents the necessary condition for $q$ .

A.
Both A and R are true, and R is the correct explanation of A
B.
Both A and R are true, but R is NOT the correct explanation of A
C.
A is true, but R is false
D.
A is false, but R is true

Correct Answer:

Step-by-Step Solution

Key idea: "p only if q" translates to $p \to q$ , where q is the necessary condition.

Step 1: Evaluate Assertion (A): The phrase " $p$ only if $q$ " indeed translates to $p \to q$ . So A is TRUE.

Step 2: Evaluate Reason (R): In the conditional $p \to q$ , $p$ is the sufficient condition and $q$ is the necessary condition. R claims $p$ is the necessary condition for $q$ , which is FALSE.

Step 3: Since A is true and R is false, the correct option is C.

Answer: Option C.

Try a question

Login to view the complete practice questions and solutions

Personalised first. High quality throughout.

Built around you, not around a syllabus PDF

Revision that hits your weak spots

Questions calibrated to the real exam

Notes written for recall, not for volume

One place for everything

Honest progress

Unlock the whole course

Propositional Logic and Logical Equivalence Practice Questions for GATE DA

Chapter Roadmap: Propositional Logic

Chapter Journey: Propositional Logic

The Core of Logical Reasoning

Propositional Logic and Logical Equivalence: Solved Questions with Step-by-Step Explanations (10 Problems)

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

More practice questions in this unit