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

41–60 OF 108 · NEWEST FIRST

JEE MAIN 2022 · 26 JUL S2Logical connectives, truth tables and tautologiesTRANSCRIBED

Negation of the Boolean expression p↔(q→p)p \leftrightarrow (q \rightarrow p) is

  1. A

    ∼p∧q\sim p \wedge q

  2. B

    p∧∼qp \wedge \sim q

  3. C

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

  4. D

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

JEE MAIN 2022 · 25 JUN S2Logical connectives, truth tables and tautologiesTRANSCRIBED

The negation of the Boolean expression ∼q∧p⇒∼p∨q\sim q \wedge p \Rightarrow \sim p \vee q is logically equivalent to

  1. A

    p⇒qp \Rightarrow q

  2. B

    q⇒pq \Rightarrow p

  3. C

    ∼(p⇒q)\sim(p\Rightarrow q)

  4. D

    ∼q⇒p\sim q \Rightarrow p

JEE MAIN 2022 · 28 JUN S2Logical connectives, truth tables and tautologiesTRANSCRIBED

The maximum number of compound propositions, out of p∨r∨sp \vee r \vee s, p∨r∨∼sp \vee r \vee \sim s, p∨∼q∨sp \vee \sim q \vee s, ∼p∨∼r∨s\sim p \vee \sim r \vee s, ∼p∨∼r∨∼s\sim p \vee \sim r \vee \sim s, ∼p∨q∨∼s\sim p \vee q \vee \sim s, q∨r∨∼sq \vee r \vee \sim s, q∨∼r∨∼sq \vee \sim r \vee \sim s, ∼p∨∼q∨∼s\sim p \vee \sim q \vee \sim s that can be made simultaneously true by an assignment of the truth values to p,q,rp, q, r and ss, is equal to

JEE MAIN 2021 · 24 FEB S2Logical connectives, truth tables and tautologiesTRANSCRIBED

The negation of the statement ∼p∧(p∨q)\sim p \wedge (p \vee q) is:

  1. A

    ∼p∨q\sim p \vee q

  2. B

    ∼p∧q\sim p \wedge q

  3. C

    p∨∼qp \vee \sim q

  4. D

    p∧∼qp \wedge \sim q

JEE MAIN 2021 · 24 FEB S2Logical connectives, truth tables and tautologiesTRANSCRIBED

For the statements pp and qq, consider the following compound statements:
(a)(a) (∼q∧(p→q))→∼p(\sim q \wedge (p \to q)) \to \sim p
(b)(b) ((p∨q)∧∼p)→q((p \vee q) \wedge \sim p) \to q
Then which of the following statements is correct?

  1. A

    (b)(b) is a tautology but not (a)(a).

  2. B

    (a)(a) and (b)(b) both are tautologies.

  3. C

    (a)(a) and (b)(b) both are not tautologies.

  4. D

    (a)(a) is a tautology but not (b)(b).

JEE MAIN 2021 · 27 AUG S2Logical connectives, truth tables and tautologiesTRANSCRIBED

The Boolean expression (p∧q)⇒((r∧q)∧p)(p \wedge q) \Rightarrow ((r \wedge q) \wedge p) is equivalent to:

  1. A

    (p∧r)⇒(p∧q)(p \wedge r) \Rightarrow (p \wedge q)

  2. B

    (q∧r)⇒(p∧q)(q \wedge r) \Rightarrow (p \wedge q)

  3. C

    (p∧q)⇒(r∧q)(p \wedge q) \Rightarrow (r \wedge q)

  4. D

    (p∧q)⇒(r∨q)(p \wedge q) \Rightarrow (r \vee q)

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

The Boolean expression (p∧∼q)⇒(q∨∼p)(p \wedge \sim q) \Rightarrow (q \vee \sim p) is equivalent to:

  1. A

    q⇒pq \Rightarrow p

  2. B

    p⇒qp \Rightarrow q

  3. C

    ∼q⇒p\sim q \Rightarrow p

  4. D

    p⇒∼qp \Rightarrow \sim q

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

The statement among the following that is a tautology is:

  1. A

    A∨A∧BA \lor A \land B

  2. B

    A∧A∨BA \land A \lor B

  3. C

    B→A∧A→BB \to A \land A \to B

  4. D

    A∧A→B→BA \land A \to B \to B

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

Which of the following Boolean expressions is not a tautology?

  1. A

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

  2. B

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

  3. C

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

  4. D

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

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

The Boolean expression (p⇒q)∧(q⇒∼p)(p \Rightarrow q) \wedge (q \Rightarrow \sim p) is equivalent to:

  1. A

    ∼q\sim q

  2. B

    qq

  3. C

    pp

  4. D

    ∼p\sim p

JEE MAIN 2021 · 26 FEB S2Logical connectives, truth tables and tautologiesTRANSCRIBED

Let F1(A,B,C)=(A∧∼B)∨[∼C∧(A∨B)]∨∼AF_1(A, B, C) = (A \wedge \sim B) \vee [\sim C \wedge (A \vee B)] \vee \sim A and F2(A,B)=(A∨B)∨(B→∼A)F_2(A, B) = (A \vee B) \vee (B \to \sim A) be two logical expressions. Then:

  1. A

    F1F_1 is a tautology but F2F_2 is not a tautology

  2. B

    F1F_1 is not a tautology but F2F_2 is a tautology

  3. C

    Both F1F_1 and F2F_2 are not tautologies

  4. D

    F1F_1 and F2F_2 both are tautologies

JEE MAIN 2021 · 16 MAR S1Logical connectives, truth tables and tautologiesTRANSCRIBED

Which of the following Boolean expression is a tautology?

  1. A

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

  2. B

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

  3. C

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

  4. D

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

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

If PP and QQ are two statements, then which of the following compound statement is a tautology?

  1. A

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

  2. B

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

  3. C

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

  4. D

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

JEE MAIN 2021 · 31 AUG S1Logical connectives, truth tables and tautologiesTRANSCRIBED

Let ∗,□∈{∧,∨}*, \square \in \{\wedge, \vee\} be such that the Boolean expression (p∗∼q)⇒(p□q)(p * \sim q) \Rightarrow (p \square q) is a tautology. Then:

  1. A

    ∗=∨,□=∧* = \vee, \square = \wedge

  2. B

    ∗=∨,□=∨* = \vee, \square = \vee

  3. C

    ∗=∧,□=∨* = \wedge, \square = \vee

  4. D

    ∗=∧,□=∧* = \wedge, \square = \wedge

JEE MAIN 2021 · 31 AUG S2Logical connectives, truth tables and tautologiesTRANSCRIBED

Negation of the statement (p∨r)⇒(q∨r)(p \vee r) \Rightarrow (q \vee r) is:

  1. A

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

  2. B

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

  3. C

    p∧∼q∧∼rp \wedge \sim q \wedge \sim r

  4. D

    p∧q∧rp \wedge q \wedge r

JEE MAIN 2021 · 01 SEP S2Logical connectives, truth tables and tautologiesTRANSCRIBED

Which of the following is equivalent to the Boolean expression p∧∼qp \wedge \sim q?

  1. A

    ∼p→∼q\sim p \rightarrow \sim q

  2. B

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

  3. C

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

  4. D

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

JEE MAIN 2021 · 26 AUG S2Logical connectives, truth tables and tautologiesTRANSCRIBED

Consider the two statements:
(S1):(p→q)∨(∼q→p)(S_1) : (p \rightarrow q) \vee (\sim q \rightarrow p) is a tautology.
(S2):(p∧∼q)∧(∼p∨q)(S_2) : (p \wedge \sim q) \wedge (\sim p \vee q) is a fallacy.
Then:

  1. A

    only (S1)(S_1) is true.

  2. B

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

  3. C

    only (S2)(S_2) is true.

  4. D

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

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

The statement (p∧(p→q)∧(q→r))→r(p \wedge (p \rightarrow q) \wedge (q \rightarrow r)) \rightarrow r is

  1. A

    a tautology

  2. B

    equivalent to q→∼rq \rightarrow \sim r

  3. C

    a fallacy

  4. D

    equivalent to p→∼rp \rightarrow \sim r

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

If the Boolean expression (p⇒q)⇔(q∗(∼p))(p \Rightarrow q) \Leftrightarrow (q * (\sim p)) is a tautology, then the Boolean expression p∗(∼q)p * (\sim q) is equivalent to:

  1. A

    q⇒pq \Rightarrow p

  2. B

    ∼q⇒p\sim q \Rightarrow p

  3. C

    p⇒∼qp \Rightarrow \sim q

  4. D

    p⇒qp \Rightarrow q

JEE MAIN 2021 · 26 AUG S1Logical connectives, truth tables and tautologiesTRANSCRIBED

If the truth value of the Boolean expression ((p∨q)∧(q→r)∧(∼r))→(p∧q)((p \vee q) \wedge (q \rightarrow r) \wedge (\sim r)) \rightarrow (p \wedge q) is false, then the truth values of the statements pp, qq, rr respectively can be:

  1. A

    FTF

  2. B

    TFF

  3. C

    TFT

  4. D

    FFT