PYQ Vault

MHT-CET Maths · Mathematical Logic

Finding Truth Values of Component Statements

Given that a whole statement pattern is false (or true), work backwards to pin down the truth values of p, q and r.

Why this matters

This is the chapter's signature move and the single most repeated question shape on the paper — 31 PYQs sit here, and only 16% are HARD, which makes it the best return on effort in the chapter. The reason it is cheap is that you never build a table: a conditional is false in exactly one row, so being told it is false HANDS you the values rather than leaving you to search for them. Recognise the shape and most of these take under a minute.

Concept 1 of 4: The Forced Row of a False Conditional

A conditional fails in exactly one way. So if a question tells you that a conditional is FALSE, it has not given you a puzzle — it has given you the answer. The antecedent must be true and the consequent must be false, and everything else follows from unpacking those two facts.

Definition

If X→YX \to Y is false, then immediately X=TX = T and Y=FY = F. There is no other possibility.

  • Unpack X=TX = T: every part of a conjunction must be T.
  • Unpack Y=FY = F: every part of a disjunction must be F.
  • A conjunction being true and a disjunction being false are both forcing — each pins down every letter inside it.

This is why the false case is easy and the true case is not: X→Y=TX \to Y = T has three rows and forces nothing.

The one false row of a conditional

X→Y=F  ⟺  X=T   and   Y=F(A∧B)=T⇒A=B=T(A∨B)=F⇒A=B=FX \to Y = F \iff X = T \;\text{ and }\; Y = F \qquad (A \wedge B) = T \Rightarrow A = B = T \qquad (A \vee B) = F \Rightarrow A = B = F
  • XXthe antecedent — forced TRUE
  • YYthe consequent — forced FALSE

Worked example

If (p∧∼q)→(q∨r)(p \wedge \sim q) \to (q \vee r) is false, find the truth values of pp, qq and rr.
Practise this conceptself-check · 4 quick reps

The same idea in a real exam question:

MHT-CET · 2023 · 10th May Shift 2 · Q150Moderate

Example 1 · Mathematical Logic · Finding Truth Values of Component Statements

If (p∧∼r)→(∼p∨q)(p\wedge\sim r)\rightarrow(\sim p\vee q) has truth value False, then truth values of p, q, r are respectively.

Trying to work backwards from a TRUE conditional

X→Y=TX \to Y = T is satisfied by three of the four rows, so it forces nothing on its own. If a stem says a conditional is true, the information you need is somewhere else in the stem — look for a second given, not for a forced row.

Concept 2 of 4: Forced Values from a Biconditional

A biconditional says the two sides agree. So being told one is true tells you the sides match, and being told it is false tells you they differ — and if you already know one side, the other is settled immediately.

Definition

For X↔YX \leftrightarrow Y:

  • True means XX and YY have the same truth value.
  • False means they have different truth values.

Unlike a conditional, the TRUE case is informative here — it is a matching rule, not a three-row escape. If the stem fixes one side by any route, the other side follows with no case work.

The matching rule

X↔Y=T  ⟺  X=YX↔Y=F  ⟺  X≠YX \leftrightarrow Y = T \iff X = Y \qquad X \leftrightarrow Y = F \iff X \neq Y
  • X,YX, Ythe two sides, which may themselves be compound

Worked example

Given that qq is false and (p∧q)↔r(p \wedge q) \leftrightarrow r is true, find rr.
Practise this conceptself-check · 4 quick reps

The same idea in a real exam question:

MHT-CET · 2024 · 11th May Shift 2 · Q127Hard

Example 2 · Mathematical Logic · Finding Truth Values of Component Statements

If truth value of logical statement (p↔∼q)→(∼p∧q)(p\leftrightarrow\sim q)\to(\sim p\wedge q) is false, then the truth values of p and q are respectively

Hunting for p when p is not determined

In 'q is false and (p∧q)↔r(p \wedge q) \leftrightarrow r is true', pp never gets pinned down and does not need to be — the answer depends only on rr. Students lose time trying to force a value that the stem deliberately leaves open. If a letter cancels out, move on.

Concept 3 of 4: Chaining Two Given Truth Values

Some stems give you two compound facts at once — 'p implies r is false AND p if and only if q is false'. Take them in the order that forces the most: the false conditional pins two letters outright, and the second given then names the third.

Definition

With several givens, order your work by how much each one forces:

  • A false conditional forces two letters. Do it first.
  • A false or true biconditional then settles a remaining letter by matching or differing.
  • A true conjunction or false disjunction also force; a true conditional and a true disjunction generally do not.

Once every letter is known, the rest of the question is plain one-row substitution.

Worked example

The truth value of p→rp \to r is F and the truth value of p↔qp \leftrightarrow q is F. Find the truth value of (∼p∨q)→(p∨∼q)(\sim p \vee q) \to (p \vee \sim q).
Practise this conceptself-check · 4 quick reps

The same idea in a real exam question:

MHT-CET · 2023 · 16th May Shift 2 · Q110Moderate

Example 3 · Mathematical Logic · Finding Truth Values of Component Statements

Truth values of p→rp \to r is F and p↔qp \leftrightarrow q is F. Then the truth values of (∼p∨q)→(p∨∼q)(\sim p \vee q) \to (p \vee \sim q) and (p∧∼q)→(∼p∧q)(p \wedge \sim q) \to (\sim p \wedge q) are respectively

Starting with the given that forces least

Both givens are true statements about the same letters, but they are not equally useful. Beginning with a TRUE conditional leaves you enumerating three rows; beginning with the FALSE one settles two letters at a stroke. Scan the givens and start with a false conditional, a true conjunction or a false disjunction.

Concept 4 of 4: Testing the Options Once the Values Are Known

Many of these stems do not ask for p, q and r at all — they ask which of four statement patterns is true, or is a tautology. The deduction is only half the question. The other half is a quick one-row evaluation of each option, and there is a shortcut worth knowing.

Definition

Once every letter is pinned down, work through the options in this order:

  • Look first for an option whose antecedent is false — it is automatically true, with no further work.
  • Otherwise substitute and evaluate, innermost bracket outwards.
  • Stop at the first option that matches what is asked; on MHT-CET there is no negative marking, so a well-founded stop is free.

Worked example

Given p=T,  q=F,  r=Fp = T,\; q = F,\; r = F, decide which of these is true: (A) q→(p∧r)q \to (p \wedge r) (B) p→(q∧r)p \to (q \wedge r) (C) p∧(q∨r)p \wedge (q \vee r).
Practise this conceptself-check · 4 quick reps

The same idea in a real exam question:

MHT-CET · 2025 · 20 April Shift I · Q117Moderate

Example 4 · Mathematical Logic · Finding Truth Values of Component Statements

If a statement qq has truth value False and (p∧q)↔r(p\land q) \leftrightarrow r has truth value True then which of the following has truth value true?

Evaluating a consequent you never needed

If an option's antecedent works out false, the option is true and the consequent is irrelevant — however elaborate it looks. Checking the antecedent first turns several of these questions into a single glance.

Reporting the truth values when the question asked for an option

These stems often end 'then which of the following is true?' rather than 'find p, q and r'. Deducing the letters correctly and then answering the wrong question is a common and entirely avoidable loss.

Summary — formulas & gotchas at a glance

A revision cheat-sheet for the formulas and gotchas above. Click any concept name to jump back to its full explanation.

Formulas (2)

  • The Forced Row of a False Conditional

    The one false row of a conditional

    X→Y=F  ⟺  X=T   and   Y=F(A∧B)=T⇒A=B=T(A∨B)=F⇒A=B=FX \to Y = F \iff X = T \;\text{ and }\; Y = F \qquad (A \wedge B) = T \Rightarrow A = B = T \qquad (A \vee B) = F \Rightarrow A = B = F
  • Forced Values from a Biconditional

    The matching rule

    X↔Y=T  ⟺  X=YX↔Y=F  ⟺  X≠YX \leftrightarrow Y = T \iff X = Y \qquad X \leftrightarrow Y = F \iff X \neq Y

Watch out for (5)

Test yourself on Mathematical Logic

20 past MHT-CET questions from this chapter, timed at 36 minutes and marked the way the exam marks it. You see your score and every answer the moment you finish. Free to start.

Related notes