At a very fundamental level an individual (or a computer) can process only a finite amount of information in a finite time. We can therefore model the possibilities facing such an observer by a tree with only finitely many arcs leaving each node. There is a natural field of events associated with this tree, and we show that any finitely additive probability measure on this field will also be countably additive. Hence when considering the foundations of Bayesian statistics we may (...) as well assume countable additivity over a σ-field of events. (shrink)

A pure significance test would check the agreement of a statistical model with the observed data even when no alternative model was available. The paper proposes the use of a modified p -value to make such a test. The model will be rejected if something surprising is observed. It is shown that the relation between this measure of surprise and the surprise indices of Weaver and Good is similar to the relationship between a p -value, a corresponding odds-ratio, and a (...) logit or log-odds statistic. The s -value is always larger than the corresponding p -value, and is not uniformly distributed. Difficulties with the whole approach are discussed. (shrink)