Introduction to Mathematical PhilosophyRussell, Bertrand
Philosophy
Introduction to Mathematical Philosophy
Russell, Bertrand
Mathematics -- Philosophy
(1) Every propositional function must determine a class,
consisting of those arguments for which the function is true.
Given any proposition (true or false), say about Socrates, we
can imagine Socrates replaced by Plato or Aristotle or a gorilla
or the man in the moon or any other individual in the world.
In general, some of these substitutions will give a true proposition
and some a false one. The class determined will consist of all
those substitutions that give a true one. Of course, we have
still to decide what we mean by "all those which, etc." All that
[Pg 184]
we are observing at present is that a class is rendered determinate
by a propositional function, and that every propositional function
determines an appropriate class.
(2) Two formally equivalent propositional functions must
determine the same class, and two which are not formally equivalent
must determine different classes. That is, a class is determined
by its membership, and no two different classes can have
the same membership. (If a class is determined by a function ,
we say that is a "member" of the class if is true.)
(3) We must find some way of defining not only classes, but
classes of classes. We saw in Chapter II. that cardinal numbers
are to be defined as classes of classes. The ordinary phrase
of elementary mathematics, "The combinations of things
at a time" represents a class of classes, namely, the class of
all classes of terms that can be selected out of a given class
of terms. Without some symbolic method of dealing with
classes of classes, mathematical logic would break down.
(4) It must under all circumstances be meaningless (not false)
to suppose a class a member of itself or not a member of itself.
This results from the contradiction which we discussed in
Chapter XIII.
(5) Lastly—and this is the condition which is most difficult
of fulfilment,—it must be possible to make propositions about
all the classes that are composed of individuals, or about all the
classes that are composed of objects of any one logical "type."
If this were not the case, many uses of classes would go astray—for
example, mathematical induction. In defining the posterity
of a given term, we need to be able to say that a member of the
posterity belongs to all hereditary classes to which the given
term belongs, and this requires the sort of totality that is in
question. The reason there is a difficulty about this condition
is that it can be proved to be impossible to speak of all the propositional
functions that can have arguments of a given type.
Public-domain text, read in full here on John Shaqi.
Reviews
Reviews
No reviews yet
Be the first to share your thoughts on this work.
Elsewhere in the archive
Join the Discussion
Join the discussion
Sign in to leave a comment or review.
Sign InorCreate an account