Probabilities of conditionals - revisited (Q911579)

This is a neat, crisp demonstration of this theorem: If K is a finite set with cardinality greater than two, F is a field of subsets of K, and P a probability function on F, then there is no binary connective \(\to\) on F such that for all A, C in F, if \(P(A)>0\), then \(P(A\to C)=P(C/A)\). This is a clear and important strengthening of David Lewis' triviality results concerning the hypothesis (often called the Stalnaker hypothesis) that the probability of a conditional should be the conditional probability of the components.