My title is intended to recall Terence Fine's excellent survey, Theories of Probability [1973]. I shall consider some developments that have occurred in the intervening years, and try to place some of the theories he discussed in what is now a slightly longer perspective. Completeness is not something one can reasonably hope to achieve in a journal article, and any selection is bound to reflect a view of what is salient. In a subject as prone to dispute as this, there (...) will inevitably be many who will disagree with any author's views, and I take the opportunity to apologize in advance to all such people for what they will see as the narrowness and distortion of mine. (shrink)

The foundation of statistical mechanics and the explanation of the success of its methods rest on the fact that the theoretical values of physical quantities (phase averages) may be compared with the results of experimental measurements (infinite time averages). In the 1930s, this problem, called the ergodic problem, was dealt with by ergodic theory that tried to resolve the problem by making reference above all to considerations of a dynamic nature. In the present paper, this solution will be analyzed first, (...) highlighting the fact that its very general nature does not duly consider the specificities of the systems of statistical mechanics. Second, Khinchin’s approach will be presented, that starting with more specific assumptions about the nature of systems, achieves an asymptotic version of the result obtained with ergodic theory. Third, the statistical meaning of Khinchin’s approach will be analyzed and a comparison between this and the point of view of ergodic theory is proposed. It will be demonstrated that the difference consists principally of two different perspectives on the ergodic problem: that of ergodic theory puts the state of equilibrium at the center, while Khinchin’s attempts to generalize the result to non-equilibrium states. (shrink)

Bruno de Finetti's earliest works on the foundations of probability are reviewed. These include the notion of exchangeability and the theory of random processes with independent increments. The latter theory relates to de Finetti's ideas for a probabilistic science more generally. Different aspects of his work are united by his foundational programme for a theory of subjective probabilities.

We argue that in spite of their apparent dissimilarity, the methodologies employed in the a priori and a posteriori assessment of probabilities can both be justified by appeal to a single principle of inductive reasoning, viz., the principle of symmetry. The difference between these two methodologies consists in the way in which information about the single-trial probabilities in a repeatable chance process is extracted from the constraints imposed by this principle. In the case of a posteriori reasoning, these constraints inform (...) the analysis by fixing an a posteriori determinant of the probabilities, whereas, in the case of a priori reasoning, they imply certain claims which then serve as the basis for subsequent probabilistic deductions. In a given context of inquiry, the particular form which a priori or a posteriori reason may take depends, in large part, on the strength of the underlying symmetry assumed: the stronger the symmetry, the more information can be acquired a priori and the less information about the long-run behavior of the process is needed for an a posteriori assessment of the probabilities. In the context of this framework, frequency-based reasoning emerges as a limiting case of a posteriori reasoning, and reasoning about simple games of chance, as a limiting case of a priori reasoning. Between these two extremes, both a priori and a posteriori reasoning can take a variety of intermediate forms. (shrink)

The scheme of abstract dynamical systems will represent repetitive experimentation: There is a basic space of events X1 and the denumerable product … contains all possible sequences of events x = (x1, x2, … ). There are projections qn which give the nth member of x: qn (x) = xn. A transformation T is defined over X by the equation qn (Tx)= q n+1 (x). It removes the sequence by one step, T(x1,x2,…) = (x2,x3,…) and is known as the shift (...) transformation. It comes as an abstraction of the dynamical transformations of classical theories. Here it represents the performance of ‘the next’ experiment. (shrink)