25.01.2013 Views

popper-logic-scientific-discovery

popper-logic-scientific-discovery

popper-logic-scientific-discovery

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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

384<br />

new appendices<br />

the required a always exists; and there always is also another law, a′,<br />

yielding the same first n − 1 results but predicting, for the nth toss, the<br />

opposite result. It would be paradoxical, therefore, to accept Jeffreys’s<br />

case (3), since for a sufficiently large n we would always obtain p(b n,<br />

b n − 1 ) close to 1, and also (from another law, a′) p(b¯ n, b n − 1 ) close to 1.<br />

Accordingly, Jeffreys’s argument, which is mathematically inescapable,<br />

can be used to prove his case (2), which happens to coincide with my<br />

own formula (2), as stated at the beginning of this appendix. 10<br />

We may sum up our criticism of ( + ) as follows. Some people believe<br />

that, for purely <strong>logic</strong>al reasons, the probability that the next thing we<br />

meet will be red increases in general with the number of red things<br />

seen in the past. But this is a belief in magic—in the magic of human<br />

language. For ‘red’ is merely a predicate; and there will always be<br />

predicates A and B which both apply to all the things so far observed,<br />

but lead to incompatible probabilistic predictions with respect to the<br />

next thing. These predicates may not occur in ordinary languages, but<br />

they can always be constructed. (Strangely enough, the magical belief<br />

here criticized is to be found among those who construct artificial<br />

model languages, rather than among the analysts of ordinary language.)<br />

By thus criticizing ( + ) I am defending, of course, the principle<br />

of the (absolute <strong>logic</strong>al) independence of the various a n from any combination<br />

a ia j . . . ; that is to say, my criticism amounts to a defence of (4) and (1).<br />

There are further proofs of (1). One of them which is fundamentally<br />

due to an idea of Jeffreys and Wrinch 11 will be discussed more fully in<br />

appendix *viii. Its main idea may be put (with slight adjustments) as<br />

follows.<br />

Let e be an explicandum, or more precisely, a set of singular facts or data<br />

which we wish to explain with the help of a universal law. There will<br />

be, in general, an infinite number of possible explanations—even an<br />

infinite number of explanations (mutually exclusive, given the data e)<br />

such that the sum of their probabilities (given e) cannot exceed unity.<br />

But this means that the probability of almost all of them must be<br />

zero—unless, indeed, we can order the possible laws in an infinite<br />

10 Jeffreys himself draws the opposite conclusion: he adopts as valid the possibility stated<br />

in case (3).<br />

11 Philos. Magazine 42, 1921, pp. 369 ff.

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

Saved successfully!

Ooh no, something went wrong!