modus ponens
Modus ponens![]()
is a rule of inference
![]()
that is commonly found in many logics where the binary logical connective (sometimes written or ) called logical implication are defined. Informally, it states that
from and , we may infer .
Modus ponens is also called the rule of detachment: the theorem![]()
can be “detached” from the theorem provided that is also a theorem.
An example of this rule is the following: From the premisses “It is raining”,
and “If it rains, then my laundry will be soaked”, we may draw the conclusion![]()
“My laundry will be soaked”.
Two common ways of mathematically denoting modus ponens are the following:
One formal way of looking at modus ponens is to define it as a partial function![]()
where is a set of formulas
![]()
in a language
where a binary operation
![]()
is defined, such that
-
1.
is defined whenever and for some , and
-
2.
when this is the case, and ;
-
3.
is not defined otherwise.
Remark. With modus ponens, one can easily prove the converse![]()
of the deduction theorem
![]()
(see this link (http://planetmath.org/DeductionTheorem)). Another easily proven fact is the following:
If and , then , where is a set of formulas.
To see this, let be a deduction![]()
of from , and be a deduction of from . Then is a deduction of from , where is inferred from (which is ) and (which is ) by modus ponens.
| Title | modus ponens |
|---|---|
| Canonical name | ModusPonens |
| Date of creation | 2013-03-22 16:50:48 |
| Last modified on | 2013-03-22 16:50:48 |
| Owner | CWoo (3771) |
| Last modified by | CWoo (3771) |
| Numerical id | 19 |
| Author | CWoo (3771) |
| Entry type | Definition |
| Classification | msc 03B22 |
| Classification | msc 03B05 |
| Classification | msc 03B35 |
| Synonym | rule of detachment |
| Synonym | detachment |
| Synonym | modus ponendo ponens |