The basic law for relative exhaustiveness tells us that, when sentences φ and φ′ are contradictory, having one as a premise comes to the same thing as having the other as a conclusion—that is,
Γ ⇒ φ, Δ if and only if Γ, φ′ ⇒ Δ
If we apply this to the contradictories φ and ¬ φ, we get a pair of principles
Γ ⇒ ¬ φ, Δ if and only if Γ, φ ⇒ Δ
Γ, ¬ φ ⇒ Δ if and only if Γ ⇒ φ, Δ
where we get the second by turning around both the pair of contradictories and the if-and-only-if claim. That is, having a negation as either a premise or alternative comes to the same thing as having the unnegated sentence in the opposite role. The kind opposition in question here is the sort of duality mentioned in 1.4.6.
We do not study relative exhaustiveness directly, and one use of the basic law for relative exhaustiveness is to exchange alternatives for premises so that a claim of relative exhaustiveness may be converted into a claim of entailment. But suppose we begin with only a single alternative; that is, suppose Δ is empty. In this case, when φ and φ′ are contradictory, we can say that
Γ ⇒ φ if and only if Γ, φ′ ⇒
where the right-hand side says that φ′ is inconsistent with (or is excluded by) Γ. When we express inconsistency by way of the validity of a reductio argument, we get the following basic law for contradictories:
if φ and φ′ are contradictory, then Γ ⇒ φ if and only if Γ, φ′ ⇒ ⊥
Indeed, if the right-hand side of this holds for every choice of the set Γ, then φ and φ′ must be contradictory. (To see why, think what follows if Γ is chosen first as the single sentence φ and then as the sentence ¬ φ′.)
Now we can get some basic principles for negation with regard to entailment by applying the basic law for contradictories to the case of negation in the way we applied the basic law for relative exhaustiveness above. That is, if we take φ and ¬ φ as our contradictory sentences, we get:
Law for negation as a conclusion. Γ ⇒ ¬ φ if and only if Γ, φ ⇒ ⊥
Law for negation as a premise. Γ, ¬ φ ⇒ ⊥ if and only if Γ ⇒ φ
again reversing the pair of contradictories and the if-and-only-if claim to get the second.
Although these principles are dual in something like the way that the earlier pair for relative exhaustiveness were, each has a rather different significance. The first captures the core properties of negation while the second is closely tied to the equivalence of ¬ ¬ φ with φ (which, as was noted in §3.1.3, is about as controversial as anything gets in logic). Also, while the first will provide us with straightforward ways of planning for negative goals and carrying out these plans, the second gives an account of the role of negative premises only in the context of reductio arguments and, for this reason, has a less straightforward implementation as a derivation rule that we will postpone until §3.3.