Thursday, September 24th, 2009
The Modus Tollens Rule Explained
Description
A detailed tutorial on the modus tollens rule. Step by step tutorial including several example problems of the modus tollens rule for reference.
Overview
Modus tollendo tollens, often simply referred to as modus tollens, is an argument in logic that states if P, then Q. Negation of Q, therefore negation of P. This is sometimes called denying the consequent, and is often confused with the indirect proof of proving by contraposition. There are several forms that the modus tollens rule can take, depending on when and how you are using it.
Logical Operator Notation: 
Basic Form: 
With Assumptions: 
Set Theory:
Predicate Logic:
Tags: assumptions, discrete math, logic, logical operator, Math, modus tollendo tollens, modus tollens, negation, P, predicate, proofs, Q, rule, sequent, set theory, then, therefore, truth tables
Posted in Discrete Math | No Comments »
Thursday, September 24th, 2009
The Modus Ponens Rule Explained
Description
A detailed tutorial on the modus ponens rule. Step by step tutorial including several examples of the modus ponens rule for reference.
Overview
Modus ponendo ponens, typically shortened to just modus ponens, is an argument in logic. It is closely related to the argument modus tollens. Modus ponens states that if P, then Q. P, therefore Q. This can be expressed in either sequent form or rule form for formal notation.
Sequent Form: 
Rule Form: 
Tags: discrete math, logic, Math, modus ponendo ponens, modus ponens, P, proofs, Q, rule, sequent, then, therefore, truth tables
Posted in Discrete Math | No Comments »
