|Rules of inference|
|Rules of replacement|
In propositional logic, modus tollens (/
The inference rule modus tollens validates the inference from implies and the contradictory of to the contradictory of .
The modus tollens rule can be stated formally as:
where stands for the statement "P implies Q". stands for "it is not the case that Q" (or in brief "not Q"). Then, whenever "" and "" each appear by themselves as a line of a proof, then "" can validly be placed on a subsequent line. The history of the inference rule modus tollens goes back to antiquity.
Modus tollens is closely related to modus ponens. There are two similar, but invalid, forms of argument: affirming the consequent and denying the antecedent. See also contraposition and proof by contrapositive.
- 1 Formal notation
- 2 Explanation
- 3 Relation to modus ponens
- 4 Justification via truth table
- 5 Formal proof
- 6 Correspondence to other mathematical frameworks
- 7 See also
- 8 Notes
- 9 Sources
- 10 External links
The modus tollens rule may be written in sequent notation:
where and are propositions expressed in some formal system;
or including assumptions:
though since the rule does not change the set of assumptions, this is not strictly necessary.
More complex rewritings involving modus tollens are often seen, for instance in set theory:
("P is a subset of Q. x is not in Q. Therefore, x is not in P.")
Also in first-order predicate logic:
("For all x if x is P then x is Q. There exists some x that is not Q. Therefore, there exists some x that is not P.")
Strictly speaking these are not instances of modus tollens, but they may be derived from modus tollens using a few extra steps.
- The argument has two premises.
- The first premise is a conditional or "if-then" statement, for example that if P then Q.
- The second premise is that it is not the case that Q.
- From these two premises, it can be logically concluded that it is not the case that P.
Consider an example:
- If the watch-dog detects an intruder, the watch-dog will bark.
- The watch-dog did not bark.
- Therefore, no intruder was detected by the watch-dog.
Supposing that the premises are both true (the dog will bark if it detects an intruder, and does indeed not bark), it follows that no intruder has been detected. This is a valid argument since it is not possible for the conclusion to be false if the premises are true. (It is conceivable that there may have been an intruder that the dog did not detect, but that does not invalidate the argument; the first premise is "if the watch-dog detects an intruder." The thing of importance is that the dog detects or does not detect an intruder, not whether there is one.)
- If I am the axe murderer, then I can use an axe.
- I cannot use an axe.
- Therefore, I am not the axe murderer.
- If Rex is a chicken, then he is a bird.
- Rex is not a bird.
- Therefore, Rex is not a chicken.
Relation to modus ponens
Every use of modus tollens can be converted to a use of modus ponens and one use of transposition to the premise which is a material implication. For example:
- If P, then Q. (premise – material implication)
- If not Q, then not P. (derived by transposition)
- Not Q . (premise)
- Therefore, not P. (derived by modus ponens)
Likewise, every use of modus ponens can be converted to a use of modus tollens and transposition.
Justification via truth table
The validity of modus tollens can be clearly demonstrated through a truth table.
|p||q||p → q|
In instances of modus tollens we assume as premises that p → q is true and q is false. There is only one line of the truth table—the fourth line—which satisfies these two conditions. In this line, p is false. Therefore, in every instance in which p → q is true and q is false, p must also be false.
Via disjunctive syllogism
|3||Material implication (1)|
|4||Disjunctive syllogism (2,3)|
Via reductio ad absurdum
|4||Modus ponens (1,3)|
|5||Conjunction introduction (2,4)|
|6||Reductio ad absurdum (3,5)|
|7||Conditional introduction (2,6)|
|4||Modus ponens (2,3)|
Correspondence to other mathematical frameworks
where the conditionals and are obtained with (the extended form of) Bayes' theorem expressed as:
In the equations above denotes the probability of , and denotes the base rate (aka. prior probability) of . The conditional probability generalizes the logical statement , i.e. in addition to assigning TRUE or FALSE we can also assign any probability to the statement. Assume that is equivalent to being TRUE, and that is equivalent to being FALSE. It is then easy to see that when and . This is because so that in the last equation. Therefore, the product terms in the first equation always have a zero factor so that which is equivalent to being FALSE. Hence, the law of total probability combined with Bayes' theorem represents a generalization of modus tollens .
Modus tollens represents an instance of the abduction operator in subjective logic expressed as:
where denotes the subjective opinion about , and denotes a pair of binomial conditional opinions, as expressed by source . The parameter denotes the base rate (aka. the prior probability) of . The abduced marginal opinion on is denoted . The conditional opinion generalizes the logical statement , i.e. in addition to assigning TRUE or FALSE the source can assign any subjective opinion to the statement. The case where is an absolute TRUE opinion is equivalent to source saying that is TRUE, and the case where is an absolute FALSE opinion is equivalent to source saying that is FALSE. The abduction operator of subjective logic produces an absolute FALSE abduced opinion when the conditional opinion is absolute TRUE and the consequent opinion is absolute FALSE. Hence, subjective logic abduction represents a generalization of both modus tollens and of the Law of total probability combined with Bayes' theorem .
- Evidence of absence
- Latin phrases
- Modus operandi
- Modus ponens
- Modus vivendi
- Non sequitur
- Proof by contradiction
- Proof by contrapositive
- Stoic logic
- Stone, Jon R. (1996). Latin for the Illiterati: Exorcizing the Ghosts of a Dead Language. London: Routledge. p. 60. ISBN 0-415-91775-1.
- Sanford, David Hawley (2003). If P, Then Q: Conditionals and the Foundations of Reasoning (2nd ed.). London: Routledge. p. 39. ISBN 0-415-28368-X.
[Modus] tollens is always an abbreviation for modus tollendo tollens, the mood that by denying denies.
- Susanne Bobzien (2002). "The Development of Modus Ponens in Antiquity", Phronesis 47.
- "Ancient Logic: Forerunners of Modus Ponens and Modus Tollens". Stanford Encyclopedia of Philosophy.
- Audun Jøsang 2016:p.2
- Audun Jøsang 2016:p.92
- Audun Jøsang, 2016, Subjective Logic; A formalism for Reasoning Under Uncertainty Springer, Cham, ISBN 978-3-319-42337-1
- Modus Tollens at Wolfram MathWorld