Question

Let pp and qq be two propositions. Consider the following two formulae in propositional logic.

S1:(¬p∧(p∨q))→qS_1: (\neg p \land (p \lor q)) \rightarrow q
S2:q→(¬p∧(p∨q))S_2: q \rightarrow (\neg p \land (p \lor q))

Which one of the following choices is correct?

Choose one option
Official answer and solution
Official answer
B
From
Official GATE 2021 answer key

Solution

Simplify the antecedent and consequent using boolean algebra and check for validity across truth values.

First simplify the compound proposition ¬p∧(p∨q)\neg p \land (p \lor q):

¬p∧(p∨q)≡(¬p∧p)∨(¬p∧q)≡False∨(¬p∧q)≡¬p∧q\neg p \land (p \lor q) \equiv (\neg p \land p) \lor (\neg p \land q) \equiv \text{False} \lor (\neg p \land q) \equiv \neg p \land q

Now analyze S1:(¬p∧q)→qS_1: (\neg p \land q) \rightarrow q. In propositional logic, (A∧B)→B(A \land B) \rightarrow B is an established tautology (simplification rule). Whenever the antecedent (¬p∧q)(\neg p \land q) is true, qq is necessarily true. Hence, S1S_1 is a tautology.

Now analyze S2:q→(¬p∧q)S_2: q \rightarrow (\neg p \land q). Consider the truth assignment where p=Truep = \text{True} and q=Trueq = \text{True}. Under this assignment, the antecedent qq is true, but the consequent ¬p∧q=False∧True=False\neg p \land q = \text{False} \land \text{True} = \text{False}. Thus True→False=False\text{True} \rightarrow \text{False} = \text{False}, so S2S_2 does not hold universally.

Consequently, S1S_1 is a tautology but S2S_2 is not a tautology, which matches option B.

Final answer

B

The answer is the one in the official GATE answer key. The solution is this site's own explanation.

Source

Paper
GATE 2021 Computer Science and Information Technology (CS, Set-1)
Question
17 of 65, printed as CS Q.7
Section
Computer Science and Information Technology

Report an error in this question

GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.