25.01.2013 Views

popper-logic-scientific-discovery

popper-logic-scientific-discovery

popper-logic-scientific-discovery

SHOW MORE
SHOW LESS
  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

probability 161<br />

example of a collective and in that way to show that collectives exist. This<br />

is because an example of an infinite sequence which is to satisfy certain<br />

conditions can only be given by a mathematical rule. But for a collective<br />

in von Mises’s sense there can be, by definition, no such rule, since<br />

any rule could be used as a gambling system or as a system of selection.<br />

This criticism seems indeed unanswerable if all possible gambling<br />

systems are ruled out.* 2<br />

Against the idea of excluding all gambling systems, another objection<br />

may be raised, however: that it really demands too much. If we are going to<br />

axiomatize a system of statements—in this case the theorems of the<br />

calculus of probability, particularly the special theorem of multiplication<br />

or Bernoulli’s theorem—then the axioms chosen should not only<br />

be sufficient for the derivation of the theorems of the system, but also (if<br />

we can make them so) necessary. Yet the exclusion of all systems of selection<br />

can be shown to be unnecessary for the deduction of Bernoulli’s<br />

theorem and its corollaries. It is quite sufficient to demand the exclusion<br />

of a special class of neighbourhood-selection: it suffices to demand that<br />

the sequence should be insensitive to selections according to arbitrarily<br />

chosen n-tuples of predecessors; that is to say, that it should be n-free from<br />

after-effects for every n, or more briefly, that it should be ‘absolutely free’.<br />

I therefore propose to replace von Mises’s principle of the excluded<br />

gambling system by the less exacting requirement of ‘absolute freedom’,<br />

in the sense of n-freedom for every n, and accordingly to define<br />

chance-like mathematical sequences as those which fulfil this requirement.<br />

The chief advantage of this is that it does not exclude all gambling<br />

systems, so that it is possible to give mathematical rules for<br />

constructing sequences which are ‘absolutely free’ in our sense, and<br />

hence to construct examples. (Cf. section (a) of appendix iv.) Thus<br />

Kamke’s objection, discussed above, is met. For we can now prove that<br />

the concept of chance-like mathematical sequences is not empty, and is<br />

therefore consistent.* 3<br />

* 2 It is, however, answerable if any given denumerable set of gambling systems is to be ruled<br />

out; for then an example of a sequence may be constructed (by a kind of diagonal<br />

method). See section *54 of the Postscript (text after note 5), on A. Wald.<br />

* 3 The reference to appendix iv is of considerable importance here. Also, most of the<br />

objections which have been raised against my theory were answered in the following<br />

paragraph of my text.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!