ArticleslgStudy

mathematics

Modus ponendo tollens

Modus ponendo tollens is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Modus ponendo tollens rather than just read about it. In short: Modus ponendo tollens (MPT; Latin: "mode that denies by affirming") is a valid rule of inference for propositional logic. It is closely related to modus ponens and modus tollendo ponens.

Key takeaways

  • Modus ponendo tollens belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Modus ponendo tollens to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Modus ponendo tollens from memory before moving on to harder problems.

Reference excerpt

Modus ponendo tollens (MPT; Latin: "mode that denies by affirming") is a valid rule of inference for propositional logic. It is closely related to modus ponens and modus tollendo ponens.

Overview MPT is usually described as having the form:

Not both A and B A Therefore, not B For example:

Ann and Bill cannot both win the race. Ann won the race. Therefore, Bill cannot have won the race. As E. J. Lemmon describes it: "Modus ponendo tollens is the principle that, if the negation of a conjunction holds and also one of its conjuncts, then the negation of its other conjunct holds." In logic notation this can be represented as:

¬ ( A ∧ B ) {\displaystyle \neg (A\land B)}

A {\displaystyle A}

∴ ¬ B {\displaystyle \therefore \neg B}

Based on the Sheffer Stroke (alternative denial), "|", the inference can also be formalized in this way:

A | B {\displaystyle A\,|\,B}

A {\displaystyle A}

∴ ¬ B {\displaystyle \therefore \neg B}

Proof

Strong form Modus ponendo tollens can be made stronger by using exclusive disjunction instead of non-conjunction as a premise:

A ∨ _ B {\displaystyle A{\underline {\lor }}B}

A {\displaystyle A}

∴ ¬ B {\displaystyle \therefore \neg B}

See also Modus tollendo ponens Stoic logic

References

Worked examples

Example 1 — a first encounter with Modus ponendo tollens

Start with the simplest possible case. Write down what Modus ponendo tollens claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Modus ponendo tollens before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Modus ponendo tollens ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Modus ponendo tollens

In research
Modus ponendo tollens appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Modus ponendo tollens in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Modus ponendo tollens is common in secondary-school and first-year university syllabi. It links to neighbouring topics Latin logical phrases, Rules of inference, Theorems in propositional logic, so understanding it makes those chapters shorter.
In everyday life
Look for Modus ponendo tollens outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Modus ponendo tollens” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Modus ponendo tollens in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Modus ponendo tollens means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Modus ponendo tollens out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Modus ponendo tollens in simple terms?

Modus ponendo tollens (MPT; Latin: "mode that denies by affirming") is a valid rule of inference for propositional logic. It is closely related to modus ponens and modus tollendo ponens.

Why does Modus ponendo tollens matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Modus ponendo tollens?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Modus ponendo tollens.

Tags

  • Latin logical phrases
  • Rules of inference
  • Theorems in propositional logic

Keep exploring