# modus ponens

is a rule of inference  that is commonly found in many logics where the binary logical connective $\to$ (sometimes written $\Rightarrow$ or $\supset$) called logical implication are defined. Informally, it states that

from $A$ and $A\to B$, we may infer $B$.

Modus ponens is also called the rule of detachment: the theorem  $b$ can be “detached” from the theorem $A\to B$ provided that $A$ 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:

 $\frac{A\quad A\to B}{B}\qquad\mbox{or}\quad\{A,A\to B\}\vdash B.$

One formal way of looking at modus ponens is to define it as a partial function  $\vdash:F\times F\to F,$ where $F$ is a set of formulas   in a language  $L$ where a binary operation  $\to$ is defined, such that

1. 1.

$\vdash(A,B)$ is defined whenever $A,B\in F$ and $B\equiv(A\to C)$ for some $C\in L$, and

2. 2.

when this is the case, $C\in F$ and $\vdash(A,B):=C$;

3. 3.

$\vdash$ 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 $\Delta\vdash A$ and $\Delta\vdash A\to B$, then $\Delta\vdash B$, where $\Delta$ is a set of formulas.

To see this, let $A_{1},\ldots,A_{n}$ be a deduction   of $A$ from $\Delta$, and $B_{1},\ldots,B_{m}$ be a deduction of $A\to B$ from $\Delta$. Then $A_{1},\ldots,A_{n},B_{1},\ldots,B_{m},B$ is a deduction of $B$ from $\Delta$, where $B$ is inferred from $A_{n}$ (which is $A$) and $B_{m}$ (which is $A\to B$) by modus ponens.

Title modus ponens ModusPonens 2013-03-22 16:50:48 2013-03-22 16:50:48 CWoo (3771) CWoo (3771) 19 CWoo (3771) Definition msc 03B22 msc 03B05 msc 03B35 rule of detachment detachment modus ponendo ponens