RankRizz

Logical connectives, truth tables and tautologies — JEE Main Previous Year Questions

Every JEE Main question on Logical connectives, truth tables and tautologies, one of the ideas inside Mathematical Reasoning: 108 questions from 2008–2023, 86 of them in the last five years. Newest first, answer key on every one. Free to read.

Questions

108

Years asked

14

Since

2008

Of the chapter

79%

Every Logical connectives, truth tables and tautologies question

61–80 OF 108 · NEWEST FIRST

JEE MAIN 2021 · 27 JUL S1Logical connectives, truth tables and tautologiesTRANSCRIBED

The compound statement (P∨Q)∧(∼P)⇒Q(P \vee Q) \wedge (\sim P) \Rightarrow Q equivalent to:

  1. A

    P∨QP \vee Q

  2. B

    P∧∼QP \wedge \sim Q

  3. C

    ∼(P⇒Q)\sim(P \Rightarrow Q)

  4. D

    ∼(P⇒Q)⇔P∧∼Q\sim(P \Rightarrow Q) \Leftrightarrow P \wedge \sim Q

JEE MAIN 2021 · 25 FEB S1Logical connectives, truth tables and tautologiesTRANSCRIBED

The statement A→(B→A)A \to (B \to A) is equivalent to:

  1. A

    A→(A∧B)A \to (A \wedge B)

  2. B

    A→(A∨B)A \to (A \vee B)

  3. C

    A→(A↔B)A \to (A \leftrightarrow B)

  4. D

    A→(A→B)A \to (A \to B)

JEE MAIN 2021 · 17 MAR S2Logical connectives, truth tables and tautologiesTRANSCRIBED

If the Boolean expression (p∧q)⊛(p⊗q)(p \wedge q) \circledast (p \otimes q) is a tautology, then ⊛\circledast and ⊗\otimes are respectively given by:

  1. A

    →,→\to, \to

  2. B

    ∧,∨\wedge, \vee

  3. C

    ∨,→\vee, \to

  4. D

    ∧,→\wedge, \to

JEE MAIN 2020 · 08 JAN S2Logical connectives, truth tables and tautologiesTRANSCRIBED

Which of the following statement is a tautology?

  1. A

    p∨(∼q)→p∧qp \vee (\sim q) \rightarrow p \wedge q

  2. B

    ∼(p∧∼q)→p∨q\sim(p \wedge \sim q) \rightarrow p \vee q

  3. C

    ∼(p∨∼q)→p∧q\sim(p \vee \sim q) \rightarrow p \wedge q

  4. D

    ∼(p∨∼q)→p∨q\sim(p \vee \sim q) \rightarrow p \vee q

JEE MAIN 2020 · 07 JAN S1Logical connectives, truth tables and tautologiesTRANSCRIBED

For two statements pp and qq, the logical statement (p→q)∧(q→∼p)(p \rightarrow q) \wedge (q \rightarrow \sim p) is equivalent to

  1. A

    pp

  2. B

    qq

  3. C

    ∼p\sim p

  4. D

    ∼q\sim q

JEE MAIN 2020 · 05 SEP S1Logical connectives, truth tables and tautologiesTRANSCRIBED

The negation of the Boolean expression x↔∼yx \leftrightarrow \sim y is equivalent to:

  1. A

    (∼x∧y)∨(∼x∧∼y)(\sim x \wedge y) \vee (\sim x \wedge \sim y)

  2. B

    (x∧y)∨(∼x∧∼y)(x \wedge y) \vee (\sim x \wedge \sim y)

  3. C

    (x∧∼y)∨(∼x∧y)(x \wedge \sim y) \vee (\sim x \wedge y)

  4. D

    (x∧y)∧(∼x∨∼y)(x \wedge y) \wedge (\sim x \vee \sim y)

JEE MAIN 2020 · 03 SEP S1Logical connectives, truth tables and tautologiesTRANSCRIBED

The proposition p→∼(p∧∼q)p \to \sim(p \wedge \sim q) is equivalent to:

  1. A

    qq

  2. B

    (∼p)∨q(\sim p) \vee q

  3. C

    (∼p)∧q(\sim p) \wedge q

  4. D

    (∼p)∨(∼q)(\sim p) \vee (\sim q)

JEE MAIN 2020 · 09 JAN S2Logical connectives, truth tables and tautologiesTRANSCRIBED

If p→(p∧∼q)p \to (p \wedge \sim q) is false, then the truth values of pp and qq are respectively:

  1. A

    F,FF, F

  2. B

    T,FT, F

  3. C

    T,TT, T

  4. D

    F,TF, T

JEE MAIN 2020 · 03 SEP S2Logical connectives, truth tables and tautologiesTRANSCRIBED

Let pp, qq, rr be three statements such that the truth value of (p∧q)→(∼q∨r)(p \wedge q) \to (\sim q \vee r) is FF. Then the truth values of pp, qq, rr are respectively:

  1. A

    T, T, F

  2. B

    T, T, T

  3. C

    T, F, T

  4. D

    F, T, F

JEE MAIN 2020 · 06 SEP S1Logical connectives, truth tables and tautologiesTRANSCRIBED

The negation of the Boolean expression p∨(∼p∧q)p \vee (\sim p \wedge q) is equivalent to:

  1. A

    p∧∼qp \wedge \sim q

  2. B

    ∼p∧∼q\sim p \wedge \sim q

  3. C

    ∼p∨∼q\sim p \vee \sim q

  4. D

    ∼p∨q\sim p \vee q

JEE MAIN 2020 · 04 SEP S1Logical connectives, truth tables and tautologiesTRANSCRIBED

Given the following two statements:
(S1)(S_1) : (q∨p)→(p↔∼q)(q \vee p) \to (p \leftrightarrow \sim q) is a tautology
(S2)(S_2) : ∼q∧(∼p↔q)\sim q \wedge (\sim p \leftrightarrow q) is a fallacy. Then:

  1. A

    both (S1)(S_1) and (S2)(S_2) are not correct.

  2. B

    only (S1)(S_1) is correct.

  3. C

    only (S2)(S_2) is correct.

  4. D

    both (S1)(S_1) and (S2)(S_2) are correct.

JEE MAIN 2020 · 08 JAN S1Logical connectives, truth tables and tautologiesTRANSCRIBED

Which one of the following is a tautology?

  1. A

    (p∧(p→q))→q(p \wedge (p \rightarrow q)) \rightarrow q

  2. B

    q→(p∧(p→q))q \rightarrow (p \wedge (p \rightarrow q))

  3. C

    p∧(p∨q)p \wedge (p \vee q)

  4. D

    p∨(p∧q)p \vee (p \wedge q)

JEE MAIN 2020 · 05 SEP S2Logical connectives, truth tables and tautologiesTRANSCRIBED

The statement (p→(q→p))→(p→(p∨q))(p \to (q \to p)) \to (p \to (p \vee q)) is:

  1. A

    equivalent to (p∧q)∨(∼q)(p \wedge q) \vee (\sim q)

  2. B

    a contradiction

  3. C

    equivalent to (p∨q)∧(∼p)(p \vee q) \wedge (\sim p)

  4. D

    a tautology

JEE MAIN 2020 · 02 SEP S2Logical connectives, truth tables and tautologiesTRANSCRIBED

Which of the following is a tautology?

  1. A

    (∼p)∧(p∨q)→q(\sim p) \wedge (p \vee q) \to q

  2. B

    (q→p)∨∼(p→q)(q \to p) \vee \sim(p \to q)

  3. C

    (∼q)∨(p∧q)→q(\sim q) \vee (p \wedge q) \to q

  4. D

    (p→q)∧(q→p)(p \to q) \wedge (q \to p)

JEE MAIN 2019 · 09 APR S1Logical connectives, truth tables and tautologiesTRANSCRIBED

For any two statement pp and qq, the negative of the expression p∨(∼p∧q)p \lor (\sim p \land q) is:

  1. A

    ∼p∨∼q\sim p \lor \sim q

  2. B

    p∧qp \land q

  3. C

    ∼p∧∼q\sim p \land \sim q

  4. D

    p↔qp \leftrightarrow q

JEE MAIN 2019 · 12 APR S1Logical connectives, truth tables and tautologiesTRANSCRIBED

If the truth value of the statement p→(∼q∨r)p \to (\sim q \vee r) is false F, then the truth values of the statements p, q, r are respectively

  1. A

    T, F, T

  2. B

    T, F, F

  3. C

    T, T, F

  4. D

    F, T, T

JEE MAIN 2019 · 10 APR S1Logical connectives, truth tables and tautologiesTRANSCRIBED

Which one of the following Boolean expression is a tautology?

  1. A

    (p∨q)∧(∼p∨∼q)(p \vee q) \wedge (\sim p \vee \sim q)

  2. B

    (p∧q)∨(p∧∼q)(p \wedge q) \vee (p \wedge \sim q)

  3. C

    (p∨q)∧(p∨∼q)(p \vee q) \wedge (p \vee \sim q)

  4. D

    (p∨q)∨(∼p∨∼q)(p \vee q) \vee (\sim p \vee \sim q)

JEE MAIN 2019 · 08 APR S2Logical connectives, truth tables and tautologiesTRANSCRIBED

Which one of the following statements is not a tautology?

  1. A

    p∨q→p∨(∼q)p \lor q \rightarrow p \lor (\sim q)

  2. B

    p∧q→(∼p∨q)p \land q \rightarrow (\sim p \lor q)

  3. C

    p→p∨qp \rightarrow p \lor q

  4. D

    p∧q→pp \land q \rightarrow p

JEE MAIN 2019 · 12 JAN S2Logical connectives, truth tables and tautologiesTRANSCRIBED

The expression ∼(∼p→q)\sim(\sim p \to q) is logically equivalent to

  1. A

    p∧∼qp \wedge \sim q

  2. B

    ∼p∧∼q\sim p \wedge \sim q

  3. C

    p∧qp \wedge q

  4. D

    ∼p∧q\sim p \wedge q

JEE MAIN 2019 · 09 JAN S1Logical connectives, truth tables and tautologiesTRANSCRIBED

If the Boolean expression p⊕q∧∼p⊙qp \oplus q \wedge \sim p \odot q is equivalent to p∧qp \wedge q, where ⊕\oplus, ⊙∈{∧,∨}\odot \in \{\wedge, \vee\}, then the ordered pair (⊕,⊙)(\oplus, \odot) is:

  1. A

    (∨,∧)(\vee, \wedge)

  2. B

    (∧,∧)(\wedge, \wedge)

  3. C

    (∨,∨)(\vee, \vee)

  4. D

    (∧,∨)(\wedge, \vee)