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.

352<br />

new appendices<br />

always fill the bill. That this is not so is shown by an example S 2<br />

containing, in addition to the elements of S 1, the elements (plus the settheoretic<br />

products of any two elements and the set-theoretic complement<br />

of any one element) of the sequence B = b 1, b 2, where b n =<br />

(0, (2 n − 1)/2 n + 2 ]. It will be easily seen that, although each b n satisfies<br />

condition (i) for the product-element of A, none of them satisfies condition<br />

(ii); so that in fact, there is no widest element in S 2 that satisfies the<br />

condition (i) for the product-element of A.<br />

Thus S 2 contains neither the set-theoretic product of A, nor a<br />

product-element in our (Boolean) sense. But S 1, and all the systems<br />

obtained by adding to S 1 a finite number of new intervals (plus products<br />

and complements) will contain a product-element of A in our<br />

sense but not in the set-theoretic sense, unless, indeed, we add to S 1 the<br />

missing half-interval h = (0, 1 2].<br />

Remembering that the emptiness of an element a may be characterized<br />

in our system by p(ā, a) ≠ 0, we can now define an ‘admissible<br />

system S’ and a ‘Borel field of probabilities S’, as follows.<br />

(i) A system S that satisfies our postulates 2 to 4 is called an admissible<br />

system if, and only if, S satisfies our set of postulates and in addition<br />

the following defining condition.<br />

Let bA = a 1b, a 2b, . . . be any decreasing sequence of elements of S.<br />

(We say in this case that A = a 1, a 2, . . . is ‘decreasing relative to b’.) Then<br />

if the product element ab of this sequence is in S, 12 then<br />

lim p(a n, b) = p(a, b)<br />

12 I might have added here ‘and if p(ab, ab) ≠ 0, so that ab is empty’: this would have<br />

approximated my formulation still more closely to Kolmogorov’s. But this condition is<br />

not necessary. I wish to point out here that I have received considerable encouragement<br />

from reading A. Rényi’s most interesting paper ‘On a New Axiomatic Theory of Probability’,<br />

Acta Mathematica Acad. Scient. Hungaricae 6, 1955, pp. 286–335. Although I had<br />

realized for years that Kolmogorov’s system ought to be relativized, and although I had<br />

on several occasions pointed out some of the mathematical advantages of a relativized<br />

system, I only learned from Rényi’s paper how fertile this relativization could be. The<br />

relative systems published by me since 1955 are more general still than Rényi’s system<br />

which, like Kolmogorov’s, is set-theoretical, and non-symmetrical; and it can be easily<br />

seen that these further generalizations may lead to considerable simplifications in the<br />

mathematical treatment.

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

Saved successfully!

Ooh no, something went wrong!