4.3.1. Detachment rules

When we exploit a disjunction using a proof by cases, we divide the parent gap into two children. Something like this is essential in any rule that allows us to exploit a disjunction by way of reasoning about its disjuncts, for the truth of a disjunction does not settle the truth values of its disjuncts. However, if we add to the disjunction information about the truth value of one disjunct, it can be possible to conclude something about the other.

In particular, if we know both that a disjunction is true and that one of its disjuncts is false, we can conclude that the other disjunct is true. This idea appears in a pattern of argument recognized long enough to have acquired a Latin name: modus tollendo ponens

 φ ∨ ψ¬± φ
MTP
 ψ
 φ ∨ ψ¬± ψ
MTP
 φ

The name refers to what the second premise and conclusion say about the two disjuncts. It can be translated, very roughly, as way, by taking, of putting. That is, the argument enables you to put forth one component as the conclusion if you take away the other component by asserting a premise that negates or de-negates it.

The use of this idea in derivations will be based on a somewhat stronger pair of principles for which we will also use the name modus tollendo ponens.

Γ, φ ∨ ψ, ¬± φ ⇒ χ if and only if Γ, ψ, ¬± φ ⇒ χ
Γ, φ ∨ ψ, ¬± ψ ⇒ χ if and only if Γ, φ, ¬± ψ ⇒ χ

These tell that, in the presence of a sentence negating or de-negating one component of a disjunction, having the disjunction as a premise comes to the same thing as having its other component as a premise. These principles depend on the validity of the arguments above and also on the fact that a disjunction is entailed by each of this components individually.

The modus tollendo ponens principles describe grounds under which we can drop a disjunction from our active resources (and replace it by one of its disjuncts), so they justify a rule Modus Tollendo Ponens (MTP) that provides an added way of exploiting a disjunction.

│¬± φ
│⋯
│φ ∨ ψ
│⋯
││⋯
││
││
│├─
││χ
│⋯
[available]



│¬± φ (n)
│⋯
│φ ∨ ψ n
│⋯
││⋯
n MTP ││ψ
││
│├─
││χ
│⋯
   
│¬± ψ
│⋯
│φ ∨ ψ
│⋯
││⋯
││
││
│├─
││χ
│⋯
[available]



│¬± ψ (n)
│⋯
│φ ∨ ψ n
│⋯
││⋯
n MTP ││φ
││
│├─
││χ
│⋯

Fig. 4.3.1-1. Developing a derivation at stage n by exploiting a disjunction when a sentence negating or de-negating one component is also an active resource.

Notice that the negated or de-negated component is not exploited, so the stage number to its right is enclosed in parentheses. And, since we are not exploiting this resource, there is no need for it to be active. As is the case with the resources required by adjunction rules or rules for closing gaps, it is enough that this resource be available. On the other hand, the disjunction itself is exploited, so it must be active and the stage number added at its right is not parenthesized.

This is only the first of a number of rules that will enable us to exploit weak compounds in the presence of information about a component. We will label as detachment rules these rules along with others that enable us to exploit resources given certain further information. The resource that is exploited by such a rule will be called the main resource while the resource that must be available but is not exploited will be called the auxiliary resource. In the case of MTP, the disjunction is the main resource and the sentence negating or de-negating one of its disjuncts is the auxiliary resource.

The second detachment rule we will add concerns the not-both form. De Morgan’s laws tell us that the form ¬ (φ ∧ ψ) is equivalent to the disjunction ¬± φ ∨ ¬± ψ, so we should expect some appropriate modification of modus tollendo ponens to be valid. The proper form is this:

 ¬ (φ ∧ ψ)φ
MPT
 ¬± ψ
 ¬ (φ ∧ ψ)ψ
MPT
 ¬± φ

These arguments are called modus ponendo tollens: they are a way of, by putting, taking. That is, if we know that φ and ψ are not both true, adding the information that one of them is true (i.e., putting it forth), enables us to conclude that the other is not true (i.e., we can take it away). The corresponding principles called modus ponendo tollens are these:

Γ, ¬ (φ ∧ ψ), φ ⇒ χ if and only if Γ, ¬± ψ, φ ⇒ χ
Γ, ¬ (φ ∧ ψ), ψ ⇒ χ if and only if Γ, ¬± φ, ψ ⇒ χ

They are based on the modus ponendo tollens arguments and also on the fact that a not-both form ¬ (φ ∧ ψ) is entailed by a sentence negating or de-negating either φ or ψ. That is, in the presence of a premise asserting φ or ψ, the not-both ¬ (φ ∧ ψ) can be replaced by a sentence that negates or de-negates the other component.

The rule Modus Ponendo Tollens (MPT) is this:

│φ [available]
│⋯
│¬ (φ ∧ ψ)
│⋯
││⋯
││
││
│├─
││θ
│⋯
│φ (n)
│⋯
│¬ (φ ∧ ψ) n
│⋯
││⋯
n MPT ││¬± ψ
││
│├─
││θ
│⋯
│ψ [available]
│⋯
│¬ (φ ∧ ψ)
│⋯
││⋯
││
││
│├─
││θ
│⋯
│ψ (n)
│⋯
│¬ (φ ∧ ψ) n
│⋯
││⋯
n MPT ││¬± φ
││
│├─
││θ
│⋯

Fig. 4.3.1-2. Developing a derivation at stage n by exploiting a negated conjunction when a conjunct is also an active resource.

As with MTP, one resource, the main resource, is exploited (and should be active) while the other, auxiliary resource, is not exploited and need only be available.

As an example of these new rules, here is an alternative version of the derivation at the end of 4.2.1:

│¬ (P ∧ ¬ G) 2
│¬ (C ∧ ¬ G) 4
│P ∨ C 3
├─
││¬ G (2),(5)
│├─
2 MPT ││¬ P (3)
3 MTP ││C (4)
4 MPT ││G (5)
││●
│├─
5 Nc ││⊥ 1
├─
1 IP │G

This is far from the only way of using the new rules to complete the derivation. To choose only the most minor variation on the one above, notice that in the second use of MPT either G or ¬ ¬ G could be concluded (since both can be described as ¬± ¬ G). And either could be used along with ¬ G to conclude ⊥ by Nc.

Notice that the supposition ¬ G (Sam didn’t grant the proposal’s significance) enables us to conclude first that ¬ P (Sam didn’t praise the proposal), then C (Sam condemned the proposal), and finally G itself. An argument by which a claim is shown to follow from its own denial is traditionally called a consequentia mirabilis (an amazing consequence) and has been a standard form of philosophical argumentation since antiquity. (For example, a common way of arguing against a skeptic who denies the existence of knowledge is show that this claim, that there is no knowledge, in fact implies that there is knowledge, which leads to the conclusion that knowledge must exist. Any reply to this argument must question the moves by which one is supposed to get from the claim that there is no knowledge to the consequence that there is knowledge because, if this transition is valid, an indirect proof will show that knowledge does exist.)

Glen Helman 15 Aug 2006