Writings of Charles S. Peirce: A Chronological Edition, Volume 8. Charles S. Peirce

Чтение книги онлайн.

      From these propositions, it follows that logical equality is subject to the following rules:—

      i. x = x.

      ii. If x = y, then y = x.

      iii. If x = y and y = z, then x = z.

      iv. Either x = y or y = z or z = x.

      The proof of these from A, B, C, by means of Rules I, II, III, is left to the student.]

      §3. LOGICAL ADDITION AND MULTIPLICATION

      [Note. The sign as explained above, is, we may trust, free from every trace of ambiguity. But while it does not hesitate between two meanings, it does carry two meanings at one and the same time. The expression x y means that either x is false or y true; but it also means that x is at least as low as y upon a scale. In short, x y not only states something, but states it under a particular aspect; and though it is anything but a poetical or rhetorical expression, it conveys its purport by means of an arithmetical simile. Now, elegance requires that this simile, once adopted, should be adhered to; and elegance, as we shall find, is every whit as important a consideration in the art of reasoning as it is in the more sensuous modes to which the name of Art is commonly appropriated. Following out this analogy, then, we proceed to inquire what are to be the logical significations of addition, subtraction, multiplication, and division.]

      Any two numbers whatever (say 5 and 2) might be chosen for u and v, the representatives of the false and the true; though there is some convenience in making v the larger. Then, the principle of contradiction is satisfied by these being different numbers; for a number, x, cannot at once be equal to 5 and to 2, and therefore the proposition represented by x cannot be at once true and false. But in order to satisfy the principle of excluded middle, that every proposition is either true or false, every letter, x, signifying a proposition must, considered as a number, be supposed subject to a quadratic equation whose roots are u and v. In short, we must have

      (x − u)(v − x) = 0.

      Since the product forming the left hand member of this equation vanishes, one of the factors must vanish. So that either x − u = 0 and x = u, or v − x = 0 and x = v. Another way of expressing the principle of excluded middle would be:

      It will be found, however, that occasion seldom arises for taking explicit account of the principle of excluded middle.

      The propositions

      Either x is false or y is true,

      and

      Either y is false or z is true,

      are expressed by the equations

      (x − u)(v − y) = 0

      (y − u)(v − z) = 0.

      For, as before, to say that the product forming the first member of each equation vanishes, is equivalent to saying that one or other factor vanishes.

      Let us now eliminate y from the above two equations. For this purpose, we multiply the first by (v − z) and the second by (x − u).

      We, thus, get

      (x − u)(v − y)(v − z) = 0

      (x − u)(y − u)(v − z) = 0.

      We now add these two equations and get

      (x − u)(v − u)(v − z) = 0.

      But the factor v − u does not vanish. We, therefore, divide by it, and so find

      (x − u)(v − z) = 0.

      The signification of this is,

      Either x is false or z is true;

      and this is the legitimate conclusion from the two propositions

      Either x is false or y is true,

      and

      Either y is false or z is true.

      Suppose, now, that we seek to find the expression of the precise denial of x [which in logical terminology is called the contradictory of x]. Call this X. Then it is necessary and sufficient that X should be true when x is false and false when x is true. We may therefore put

      X = u + v − x

      or

      X = uv/x.

      These two expressions are equal, by the equation of excluded middle.

      The simplest expression of that proposition which is true if x, y, z are all true and is false if any of them are false is

      The simplest expression for the proposition which is true if any of the propositions x, y, z, is true, but is false if all are false is

      It is now easy to see that some values of u and v are much more convenient than others. For example, the proposition which asserts that some two at least of the three propositions, x, y, z, are true, is, if u = 2, v = 5,

      but if u = − 1, v = + 1, the same statement is simply

      x + y + z − xyz.

      Perhaps the system which would most readily occur to a mathematician would be to take the true, v, as an odd number, and the false, u, as an even one,³ and not to discriminate between numbers except as odd or even. Thus, we should have

      v = 1 = 3 = 5 = 7 = etc.

      u = 0 = 2 = 4 = 6 = etc.

      In other words, we should measure round a circle, having its circumference equal to 2; so that 2 would fall on 0, 3 on 1, etc. On this system, every possible algebraical expression formed by means of the addition and multiplication of propositions would have a meaning. Thus, x + y СКАЧАТЬ