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.

appendix *iv 347<br />

if we consider that B2 is needed to prove ‘p(ba, c) � p(a, c)’, that is to<br />

say, the dual of B1. This suggests that we may use the second example<br />

for B1, changing only the value of 1.0 from 0 to 1, and that of 0.1 from<br />

1 to 0. Everything else may be left unchanged. B2 fails for a = 1, b = 0,<br />

and c = 2.)<br />

Ultimately, for showing that C is independent, we take again the<br />

same S, but assume that ā = a. If we now take p (0, 1) = 0 and in all<br />

other cases p(a, b) = 1, then C fails, because p(0¯, 1) ≠ p(1, 1). The other<br />

axioms are satisfied.<br />

This concludes the proofs of the independence of the operational<br />

axioms.<br />

As to the non-operational parts of the postulates, a proof of the<br />

independence of postulate 1 has been given above (when I commented<br />

upon this postulate).<br />

Postulate 2 requires (in its non-operational part) that whenever a<br />

and b are in S, p(a, b) is a real number. In order to show the independence<br />

of this requirement—which we may briefly refer to as ‘postulate<br />

2’—we first consider a non-numerical Boolean interpretation of S. To this end,<br />

we interpret S as an at most denumerable and non-numerical Boolean<br />

algebra (such as a set of statements, so that ‘a’, ‘b’, etc. are variable names<br />

of statements). And we stipulate that ‘x¯’ is to denote, if x is a number, the<br />

same as ‘ − x’; and if x is a Boolean element (say, a statement) then ‘x¯’ is<br />

to denote the Boolean complement (negation) of x. Similarly, we stipulate<br />

that ‘xy’; ‘x + y’; ‘x = y’; ‘x ≠ y’; and ‘x � y’, have their usual arithmetical<br />

meaning if x and y are numbers, and their well-known Boolean<br />

meanings whenever x and y are Boolean elements. (If x and y are<br />

statements, ‘x � y’ should be interpreted as ‘x entails y’.) In order to<br />

prove the independence of postulate 2, we now merely add one more<br />

stipulation: we interpret ‘p(a, b)’ as synonymous with ‘a + b¯’ in the<br />

Boolean sense. Then postulate 2 breaks down while A1, A2, A3 and all<br />

the other axioms and postulates turn into well-known theorems of<br />

Boolean algebra. 11<br />

The proofs of the independence of the existential parts of postulates<br />

3 and 4 are almost trivial. We first introduce an auxiliary system<br />

11 A slight variant of this interpretation transforms all the axioms into tautologies of the<br />

propositional calculus, satisfying all the postulates except postulate 2.

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

Saved successfully!

Ooh no, something went wrong!