Page:Scan of "Proceedings of the Cambridge Philosophical Society 19 (1917-1920)" (English, page 36).png

From Wikisource
Jump to navigation Jump to search
This page has been validated.
36
Mr Nicod, A Reduction in the number
  1. Proof of "Association," .
  2. Theorems equivalent to the definitions of , in Principia.

Proof of Identity, .

As this first proof from a single formal premiss stands in a unique position I shall, without in any way obscuring the precise play of the symbols, expound it after a more heuristic order than is usually followed.

We start with the Prop. , and the Rule enabling us to pass from the truth of to that of ; and we have to prove . This can only be reached through some proposition of the form , where is a truth of logic[1]. The proof will thus consist in passing from to by some permutative process.

A simple two-terms permutative law we do not yet possess. Our Prop. yields only a roundabout three-terms permutation, , subject to the condition of being a truth of logic[1]. This, however, is enough for our purpose.

In the Prop., write for , , :

(a) ,

being . Write now for , ; for : then by (a) and the Rule,

(b) .

From (b) in the same manner,

(c)

This enables us to pass, by the Rule, from to

(d) .

In order to complete the proof of , we need only find some expression which: (α) can be a value for , i.e. is a case of , and (β) is implied in some truth of logic, say . For, by , the Prop., and the Rule, as above,

(e) .

In (e), write for : first by (d) and the Rule, then by and the Rule, we obtain , and so

(f) .
  1. 1.0 1.1 This use of the Rule by anticipation, with still undetermined 's and 's, is in truth contrary to the nature of a non-formal rule, which must never be used to build up the structure of an argument. It must always be possible to dispense with all such 'anticipated' assertions in the final form of a proof. This will be seen to be very easy in the present case.