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%

When JEE Main asked it

Questions on Logical connectives, truth tables and tautologies in each year it was asked, the latest 12 of 14.

202324
202219
202120
202011
201912
20184
20172
20161
20152
20143
20135
20122

Every Logical connectives, truth tables and tautologies question

1–20 OF 108 · NEWEST FIRST

JEE MAIN 2023 · 01 FEB S2Logical connectives, truth tables and tautologiesTRANSCRIBED

Which of the following statements is a tautology?

  1. A

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

  2. B

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

  3. C

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

  4. D

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

JEE MAIN 2023 · 13 APR S1Logical connectives, truth tables and tautologiesTRANSCRIBED

The negation of the statement ((A∧(B∨C))⇒(A∨B))⇒A((A \wedge (B \vee C)) \Rightarrow (A \vee B)) \Rightarrow A is

  1. A

    equivalent to ∼C\sim C

  2. B

    equivalent to B∨∼CB \vee \sim C

  3. C

    a fallacy

  4. D

    equivalent to ∼A\sim A

JEE MAIN 2023 · 24 JAN S1Logical connectives, truth tables and tautologiesTRANSCRIBED

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

  1. A

    ((∼P)∨Q)∧((∼Q)∨P)((\sim P) \vee Q) \wedge ((\sim Q) \vee P)

  2. B

    (∼Q)∨P(\sim Q) \vee P

  3. C

    ((∼P)∨Q)∧(∼Q)((\sim P) \vee Q) \wedge (\sim Q)

  4. D

    (∼P)∨Q(\sim P) \vee Q

JEE MAIN 2023 · 24 JAN S1Logical connectives, truth tables and tautologiesTRANSCRIBED

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

  1. A

    ((∼P)∨Q)∧((∼Q)∨P)((\sim P) \vee Q) \wedge ((\sim Q) \vee P)

  2. B

    (∼Q)∨P(\sim Q) \vee P

  3. C

    ((∼P)∨Q)∧(∼Q)((\sim P) \vee Q) \wedge (\sim Q)

  4. D

    (∼P)∨Q(\sim P) \vee Q

JEE MAIN 2023 · 31 JAN S1Logical connectives, truth tables and tautologiesTRANSCRIBED

Consider:
S1: p⇒q∨p∧∼qp \Rightarrow q \lor p \land \sim q is a tautology.
S2: ∼p⇒∼q∧∼p∨q\sim p \Rightarrow \sim q \land \sim p \lor q is a contradiction.
Then

  1. A

    only S2 is correct

  2. B

    both S1 and S2 are correct

  3. C

    both S1 and S2 are wrong

  4. D

    only S1 is correct

JEE MAIN 2023 · 25 JAN S1Logical connectives, truth tables and tautologiesTRANSCRIBED

The statement (p∧(∼q))⇒(p⇒(∼q))(p \wedge (\sim q)) \Rightarrow (p \Rightarrow (\sim q)) is

  1. A

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

  2. B

    a tautology

  3. C

    equivalent to p∨qp \vee q

  4. D

    a contradiction

JEE MAIN 2023 · 29 JAN S2Logical connectives, truth tables and tautologiesTRANSCRIBED

The statement B⇒((¬A)∨B)B \Rightarrow ((\neg A) \vee B) is not equivalent to:

  1. A

    B⇒(A⇒B)B \Rightarrow (A \Rightarrow B)

  2. B

    A⇒(A⇔B)A \Rightarrow (A \Leftrightarrow B)

  3. C

    A⇒((¬A)⇒B)A \Rightarrow ((\neg A) \Rightarrow B)

  4. D

    B⇒((¬A)⇒B)B \Rightarrow ((\neg A) \Rightarrow B)

JEE MAIN 2023 · 25 JAN S2Logical connectives, truth tables and tautologiesTRANSCRIBED

Let △,∇∈{∧,∨}\triangle, \nabla \in \{\wedge, \vee\} be such that (p→q)△(p∇q)(p \to q) \triangle (p \nabla q) is a tautology. Then

  1. A

    △=∧,∇=∨\triangle = \wedge, \nabla = \vee

  2. B

    △=∨,∇=∧\triangle = \vee, \nabla = \wedge

  3. C

    △=∨,∇=∨\triangle = \vee, \nabla = \vee

  4. D

    △=∧,∇=∧\triangle = \wedge, \nabla = \wedge

JEE MAIN 2023 · 06 APR S1Logical connectives, truth tables and tautologiesTRANSCRIBED

Statement (P⇒Q)∧(R⇒Q)(P \Rightarrow Q) \wedge (R \Rightarrow Q) is logically equivalent to

  1. A

    P⇒R∨Q⇒RP \Rightarrow R \vee Q \Rightarrow R

  2. B

    P∧R⇒QP \wedge R \Rightarrow Q

  3. C

    P⇒R∧Q⇒RP \Rightarrow R \wedge Q \Rightarrow R

  4. D

    P∨R⇒QP \vee R \Rightarrow Q

JEE MAIN 2023 · 01 FEB S1Logical connectives, truth tables and tautologiesTRANSCRIBED

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

  1. A

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

  2. B

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

  3. C

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

  4. D

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

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

The negation of the statement p∨q∧q∨∼rp \vee q \wedge q \vee \sim r is

  1. A

    p∨r∧∼qp \vee r \wedge \sim q

  2. B

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

  3. C

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

  4. D

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

JEE MAIN 2023 · 29 JAN S1Logical connectives, truth tables and tautologiesTRANSCRIBED

If p,qp, q and rr are three propositions, then which of the following combination of truth values of pp, qq and rr makes the logical expression {(p∨q)∧((¬p)∨r)}→((¬q)∨r)\{(p \vee q) \wedge ((\neg p) \vee r)\} \to ((\neg q) \vee r) false?

  1. A

    p=T,q=F,r=Tp = T, q = F, r = T

  2. B

    p=T,q=T,r=Fp = T, q = T, r = F

  3. C

    p=F,q=T,r=Fp = F, q = T, r = F

  4. D

    p=T,q=F,r=Fp = T, q = F, r = F

JEE MAIN 2023 · 30 JAN S1Logical connectives, truth tables and tautologiesTRANSCRIBED

Among the statements:
S1: p∨q⇒r⇔p⇒rp \vee q \Rightarrow r \Leftrightarrow p \Rightarrow r
S2: p∨q⇒r⇔p⇒r∨q⇒rp \vee q \Rightarrow r \Leftrightarrow p \Rightarrow r \vee q \Rightarrow r

  1. A

    Only (S1) is a tautology

  2. B

    Neither (S1) nor (S2) is a tautology

  3. C

    Only (S2) is a tautology

  4. D

    Both (S1) and (S2) are tautologies

JEE MAIN 2023 · 15 APR S1Logical connectives, truth tables and tautologiesTRANSCRIBED

Negation of p∧(q∧∼(p∧q))p \wedge (q \wedge \sim(p \wedge q)) is

  1. A

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

  2. B

    p∨qp \vee q

  3. C

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

  4. D

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

JEE MAIN 2023 · 06 APR S2Logical connectives, truth tables and tautologiesTRANSCRIBED

Among the statements
(S1): (p⇒q)∨((∼p)∧q)(p \Rightarrow q) \lor ((\sim p) \wedge q) is a tautology
(S2): (q⇒p)⇒((∼p)∧q)(q \Rightarrow p) \Rightarrow ((\sim p) \wedge q) is a contradiction

  1. A

    Neither (S1) and (S2) is True

  2. B

    Both (S1) and (S2) are True

  3. C

    Only (S2) is True

  4. D

    Only (S1) is True

JEE MAIN 2023 · 11 APR S2Logical connectives, truth tables and tautologiesTRANSCRIBED

The converse of ((−p)∧q)⇒r((-p) \wedge q) \Rightarrow r is

  1. A

    ((−p)∨q)⇒r((-p) \vee q) \Rightarrow r

  2. B

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

  3. C

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

  4. D

    (p∨(−q))⇒(−r)(p \vee (-q)) \Rightarrow (-r)

JEE MAIN 2023 · 24 JAN S2Logical connectives, truth tables and tautologiesTRANSCRIBED

Let pp and qq be two statements. Then ∼(p∧(p→∼q))\sim(p \wedge (p \to \sim q)) is equivalent to

  1. A

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

  2. B

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

  3. C

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

  4. D

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

JEE MAIN 2023 · 31 JAN S2Logical connectives, truth tables and tautologiesTRANSCRIBED

The number of values of r∈{p,q,∼p,∼q}r \in \{p, q, \sim p, \sim q\} for which ((p∧q)⇒(r∨q))∧((p∧r)⇒q)((p \wedge q) \Rightarrow (r \vee q)) \wedge ((p \wedge r) \Rightarrow q) is a tautology, is:

  1. A

    1

  2. B

    2

  3. C

    4

  4. D

    3

JEE MAIN 2023 · 13 APR S2Logical connectives, truth tables and tautologiesTRANSCRIBED

The statement (p∧(∼q))∨((∼p)∧q)∨((∼p)∧(∼q))(p \wedge (\sim q)) \vee ((\sim p) \wedge q) \vee ((\sim p) \wedge (\sim q)) is equivalent to ____

  1. A

    ∼p∨q\sim p \vee q

  2. B

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

  3. C

    p∨∼qp \vee \sim q

  4. D

    p∨qp \vee q

JEE MAIN 2023 · 10 APR S2Logical connectives, truth tables and tautologiesTRANSCRIBED

The statement ∼p∨∼p∧q\sim p \vee \sim p \wedge q is equivalent to

  1. A

    ∼p∧q\sim p \wedge q

  2. B

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

  3. C

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

  4. D

    ∼p∨q\sim p \vee q