Question:

Let \( p \) and \( q \) be any two propositions. Consider the following propositional statements.
S1: \( p \rightarrow q \), S2: \( \neg p \land q \), S3: \( \neg p \lor q \), S4: \( \neg p \lor \neg q \)
where \( \land \) denotes conjunction (AND operation), \( \lor \) denotes disjunction (OR operation), and \( \neg \) denotes negation (NOT operation).
(Note: \( \equiv \) denotes logical equivalence)
Which one of the following options is correct?

Show Hint

Implications \( p \rightarrow q \) are logically equivalent to disjunctions \( \neg p \lor q \). Use truth tables to verify logical equivalences between logical operations.

Updated On: Apr 4, 2025

\( S_1 \equiv S_3 \)
\( S_2 \equiv S_3 \)
\( S_2 \equiv S_4 \)
\( S_1 \equiv S_4 \)

Hide Solution

Verified By Collegedunia

The Correct Option is A

Solution and Explanation

Analyze the statements.
S1: \( p \rightarrow q \) is logically equivalent to \( \neg p \lor q \) by the definition of implication.
S2: \( \neg p \land q \) represents a conjunction, and is not logically equivalent to the other expressions.
S3: \( \neg p \lor q \) is logically equivalent to \( p \rightarrow q \), which matches S1.
S4: \( \neg p \lor \neg q \) is different and is not logically equivalent to S1 or S3.
Thus, S1 is logically equivalent to S3, making Option (A) the correct answer.

Was this answer helpful?

Questions Asked in GATE DA exam

Consider the following pseudocode.

Create empty stack S
Set x = 0, flag = 0, sum = 0
Push x onto S
while (S is not empty){
    if (flag equals 0){
        Set x = x + 1
        Push x onto S
    }
    if (x equals 8):
        Set flag = 1
    if (flag equals 1){
        x = Pop(S)
        if (x is odd):
            Pop(S)
        Set sum = sum + x
    }
}
Output sum

The value of \( sum \) output by a program executing the above pseudocode is:

GATE DA - 2025
Data Structures

View Solution

Consider the following Python code snippet.

def f(a, b):
    if (a == 0):
        return b
    if (a % 2 == 1):
        return 2 * f((a - 1) / 2, b)
    return b + f(a - 1, b)

print(f(15, 10))

The value printed by the code snippet is 160 (Answer in integer).

GATE DA - 2025
Recursion

View Solution

Consider the following tables, Loan and Borrower, of a bank.

Query: \[ \pi_{\text{branch\_name}, \text{customer\_name}} (\text{Loan} \bowtie \text{Borrower}) \div \pi_{\text{branch\_name}}(\text{Loan}) \] where \( \bowtie \) denotes natural join. The number of tuples returned by the above relational algebra query is 1 (Answer in integer).
- GATE DA - 2025
- Relational Algebra
View Solution

View More Questions

Show Hint

The Correct Option is A

Solution and Explanation

Top Questions on Logic gates

Questions Asked in GATE DA exam