Page:Russell, Whitehead - Principia Mathematica, vol. I, 1910.djvu/86

From Wikisource
Jump to navigation Jump to search
This page has been validated.
64
INTRODUCTION
[CHAP.

must denote a definite integer; in fact, it denotes 111,777. But "the least integer not nameable in fewer than nineteen syllables" is itself a name consisting of eighteen syllables; hence the least integer not nameable in fewer than nineteen syllables can be named in eighteen syllables, which is a contradiction[1].

(6) Among transfinite ordinals some can be defined, while others can not; for the total number of possible definitions is [2], while the number of transfinite ordinals exceeds . Hence there must be indefinable ordinals, and among these there must be a least. But this is defined as "the least indefinable ordinal," which is a contradiction[3].

(7) Richard's paradox[4] is akin to that of the least indefinable ordinal. It is as follows: Consider all decimals that can be defined by means of a finite number of words; let be the class of such decimals. Then has terms; hence its members can be ordered as the 1st, 2nd, 3rd,‥‥ Let be a number defined as follows. If the th figure in the th decimal is , let the th figure in be (or 0, if ). Then is different from all the members of , since, whatever finite value may have, the th figure in is different from the th figure in the th of the decimals composing , and therefore is different from the th decimal. Nevertheless we have defined in a finite number of words, and therefore ought to be a member of . Thus both is and is not a member of .

In all the above contradictions (which are merely selections from an indefinite number) there is a common characteristic, which we may describe as self-reference or reflexiveness. The remark of Epimenides must include itself in its own scope. If all classes, provided they are not members of themselves, are members of , this must also apply to ; and similarly for the analogous relational contradiction. In the cases of names and definitions, the paradoxes result from considering non-nameability and indefinability as elements in names and definitions. In the case of Burali-Forti's paradox, the series whose ordinal number causes the difficulty is the series of all ordinal numbers. In each contradiction something is said about all cases of some kind, and from what is said a new case seems to be generated,

  1. This contradiction was suggested to us by Mr G. G. Berry of the Bodleian Library.
  2. is the number of finite integers. See *123.
  3. Cf. König, "Ueber die Grundlagen der Mengenlehre und das Kontinuumproblem," Math. Annalen, Vol. lxi. (1905); A. C. Dixon, "On 'well-ordered' aggregates," Proc. London Math. Soc. Series 2, Vol. iv. Part i. (1906); and E. W. Hobson, "On the Arithmetic Continuum," ibid. The solution offered in the last of these papers depends upon the variation of the "apparatus of definition," and is thus in outline in agreement with the solution adopted here. But it does not invalidate the statement in the text, if "definition" is given a constant meaning.
  4. Cf. Poincaré, "Les mathématiques et la logique," Revue de Métaphysique et de Morale, Mai 1906, especially sections vii. and ix.; also Peano, Revista de Mathematica, Vol. viii. No.5 (1906), p. 149 ff.