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

21–40 OF 108 · NEWEST FIRST

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

Among the two statements
(S1):(p⇒q)∧(p∧(∼q))(S_1) : (p \Rightarrow q) \wedge (p \wedge (\sim q)) is a contradiction and
(S2):(p∧q)∨((∼p)∧q)∨(p∧(∼q))∨((∼p)∧(∼q))(S_2) : (p \wedge q) \vee ((\sim p) \wedge q) \vee (p \wedge (\sim q)) \vee ((\sim p) \wedge (\sim q)) is a tautology

  1. A

    only (S2)(S_2) is true

  2. B

    only (S1)(S_1) is true

  3. C

    both are false

  4. D

    both are true

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

Negation of (p→q)→(q→p)(p \to q) \to (q \to p) is

  1. A

    (∼p)∨p(\sim p) \lor p

  2. B

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

  3. C

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

  4. D

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

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

The negation of (p∧(−q))∨(−p)(p \wedge (-q)) \vee (-p) is equivalent to

  1. A

    p∧(−q)p \wedge (-q)

  2. B

    p∧qp \wedge q

  3. C

    p∨(q∨(−p))p \vee (q \vee (-p))

  4. D

    p∧(q∧(−p))p \wedge (q \wedge (-p))

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

The number of ordered triplets of the truth values of p,qp, q and rr such that the truth value of the statement p∨q∧p∨r⇒q∨rp \vee q \wedge p \vee r \Rightarrow q \vee r is True, is equal to _______

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

Let p,q,rp, q, r be three logical statements. Consider the compound statements
S1:((∼p)∨q)∨((∼p)∨r)S_1 : ((\sim p) \vee q) \vee ((\sim p) \vee r) and S2:p→(q∨r)S_2 : p \to (q \vee r)
Then, which of the following is NOT true?

  1. A

    If S2S_2 is True, then S1S_1 is True

  2. B

    If S2S_2 is False, then S1S_1 is False

  3. C

    If S2S_2 is False, then S1S_1 is True

  4. D

    If S1S_1 is False, then S2S_2 is False

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

The statement (∼(p⇔∼q))∧q(\sim(p \Leftrightarrow \sim q)) \wedge q is:

  1. A

    a tautology

  2. B

    a contradiction

  3. C

    equivalent to (p⇒q)∧q(p \Rightarrow q) \wedge q

  4. D

    equivalent to (p⇒q)∧p(p \Rightarrow q) \wedge p

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

Consider the following two propositions :
P1:∼(p→∼q)P_1:\sim(p\to\sim q)

P2:(p∧∼q)∧(∼p∨q)P_2:(p\land\sim q)\land(\sim p\lor q)
If the proposition p→(∼p∨q)p\to(\sim p\lor q) is evaluated as FALSE, then

  1. A

    P1P_1 is TRUE and P2P_2 is FALSE

  2. B

    P1P_1 is FALSE and P2P_2 is TRUE

  3. C

    Both P1P_1 and P2P_2 are FALSE

  4. D

    Both P1P_1 and P2P_2 are TRUE

JEE MAIN 2022 · 26 JUN S1Logical connectives, truth tables and tautologiesTRANSCRIBED

Let Δ,∇∈{∧,∨}\Delta, \nabla \in \{\wedge, \vee\} be such that p∇q→((pΔq)∇r)p\nabla q \to ((p\Delta q)\nabla r) is a tautology. Then (p∇q)Δr(p\nabla q) \Delta r is logically equivalent to

  1. A

    (pΔr)∨q(p\Delta r) \vee q

  2. B

    (pΔr)∧q(p\Delta r) \wedge q

  3. C

    (p∧r)Δq(p \wedge r) \Delta q

  4. D

    (p∇r)∧q(p\nabla r) \wedge q

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

Let r∈(P,q,∼p,∼q)r \in (P, q, \sim p, \sim q) be such that the logical statement r∨(∼p)⇒(p∧q)∨rr \vee (\sim p) \Rightarrow (p \wedge q) \vee r is a tautology. Then rr is equal to

  1. A

    pp

  2. B

    qq

  3. C

    ∼p\sim p

  4. D

    ∼q\sim q

JEE MAIN 2022 · 27 JUN S1Logical connectives, truth tables and tautologiesTRANSCRIBED

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

  1. A

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

  2. B

    p→qp \to q

  3. C

    p→(p→q)p \to (p \to q)

  4. D

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

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

Which of the following statements is a tautology?

  1. A

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

  2. B

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

  3. C

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

  4. D

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

JEE MAIN 2022 · 29 JUN S1Logical connectives, truth tables and tautologiesTRANSCRIBED

Let Δ∈{∧,∨,⇒,⇔}\Delta \in \{\wedge, \vee, \Rightarrow, \Leftrightarrow\} be such that (p∧q)Δ((p∨q)⇒q)(p \wedge q)\Delta((p \vee q) \Rightarrow q) is a tautology. Then Δ\Delta is equal to

  1. A

    ∧\wedge

  2. B

    ∨\vee

  3. C

    ⇒\Rightarrow

  4. D

    ⇔\Leftrightarrow

JEE MAIN 2022 · 29 JUL S1Logical connectives, truth tables and tautologiesTRANSCRIBED

The statement (p∧q)⇒(p∧r)(p \wedge q) \Rightarrow (p \wedge r) is equivalent to

  1. A

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

  2. B

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

  3. C

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

  4. D

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

JEE MAIN 2022 · 24 JUN S1Logical connectives, truth tables and tautologiesTRANSCRIBED

The number of choices for Δ∈{∧,∨,⇒,⇔}\Delta \in \{\wedge, \vee, \Rightarrow, \Leftrightarrow\}, such that (pΔq)⇒((pΔ∼q)∨((∼p)Δq))(p \Delta q) \Rightarrow ((p \Delta \sim q) \vee ((\sim p) \Delta q)) is a tautology, is

  1. A

    1

  2. B

    2

  3. C

    3

  4. D

    4

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

Which of the following statement is a tautology?

  1. A

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

  2. B

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

  3. C

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

  4. D

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

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

(p∧r)⇔(p∧(∼q))(p \wedge r) \Leftrightarrow (p \wedge (\sim q)) is equivalent to (∼p)(\sim p) when rr is

  1. A

    pp

  2. B

    ∼p\sim p

  3. C

    qq

  4. D

    ∼q\sim q

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

If the truth value of the statement (P∧(∼R))→((∼R)∧Q)(P \wedge (\sim R)) \to ((\sim R) \wedge Q) is F, then the truth value of which of the following is F?

  1. A

    P∨Q→∼RP \vee Q \to \sim R

  2. B

    R∨Q→∼PR \vee Q \to \sim P

  3. C

    ∼(P∨Q)→∼R\sim(P \vee Q) \to \sim R

  4. D

    ∼(R∨Q)→∼P\sim(R \vee Q) \to \sim P

JEE MAIN 2022 · 28 JUL S1Logical connectives, truth tables and tautologiesTRANSCRIBED

Let the operations ∗,⊙∈{∧,∨}*, \odot \in \{\wedge, \vee\}. If (p∗q)⊙(p⊙∼q)(p * q) \odot (p \odot \sim q) is a tautology, then the ordered pair (∗,⊙)(*, \odot) is

  1. A

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

  2. B

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

  3. C

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

  4. D

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

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

The statement (p⇒q)∨(p⇒r)(p \Rightarrow q) \vee (p \Rightarrow r) is NOT equivalent to:

  1. A

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

  2. B

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

  3. C

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

  4. D

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

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

Negation of the Boolean statement (p∨q)⇒((∼r)∨p)(p \vee q) \Rightarrow ((\sim r) \vee p) is equivalent to:

  1. A

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

  2. B

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

  3. C

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

  4. D

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