We propose an alternative approach to probability theory closely related to the framework of numerosity theory: non-Archimedean probability (NAP). In our approach, unlike in classical probability theory, all subsets of an infinite sample space are measurable and zero- and unit-probability events pose no particular epistemological problems. We use a non-Archimedean field as the range of the probability function. As a result, the property of countable additivity in Kolmogorov's axiomatization of probability is replaced by a different type of infinite additivity.

In his "From classical to constructive probability," Weatherson offers a generalization of Kolmogorov's axioms of classical probability that is neutral regarding the logic for the object-language. Weatherson's generalized notion of probability can hardly be regarded as adequate, as the example of supervaluationist logic shows. At least, if we model credences as betting rates, the Dutch-Book argument strategy does not support Weatherson's notion of supervaluationist probability, but various alternatives. Depending on whether supervaluationist bets are specified as (a) conditional bets (Cantwell), (b) (...) unconditional bets with graded payoffs (Milne), or (c) unconditional bets with ungraded payoffs(Dietz), supervaluationist probability amounts to (a) conditional probability of truth given a truth-value, (b) the expected truth-value, or (c) the probability of truth, respectively. It is suggested that for supervaluationist logic, the third option is the most attractive one, for (unlike the other options) it preserves respect for single-premise entailment. (shrink)

According to orthodox (Kolmogorovian) probability theory, conditional probabilities are by definition certain ratios of unconditional probabilities. As a result, orthodox conditional probabilities are undefined whenever their antecedents have zero unconditional probability. This has important ramifications for the notion of probabilistic independence. Traditionally, independence is defined in terms of unconditional probabilities (the factorization of the relevant joint unconditional probabilities). Various “equivalent” formulations of independence can be given using conditional probabilities. But these “equivalences” break down if conditional probabilities are permitted to have (...) conditions with zero unconditional probability. We reconsider probabilistic independence in this more general setting. We argue that a less orthodox but more general (Popperian) theory of conditional probability should be used, and that much of the conventional wisdom about probabilistic independence needs to be rethought. (shrink)

In a penetrating investigation of the relationship between belief and quantitative degrees of confidence (or degrees of belief) Richard Foley (1992) suggests the following thesis: ... it is epistemically rational for us to believe a proposition just in case it is epistemically rational for us to have a sufficiently high degree of confidence in it, sufficiently high to make our attitude towards it one of belief. Foley goes on to suggest that rational belief may be just rational degree of confidence (...) above some threshold level that the agent deems sufficient for belief. He finds hints of this view in Locke’s discussion of probability and degrees of assent, so he calls it the Lockean Thesis.1 The Lockean Thesis has important implications for the logic of belief. Most prominently, it implies that even a logically ideal agent whose degrees of confidence satisfy the axioms of probability theory may quite rationally believe each of a large body of propositions that are jointly inconsistent. For example, an agent may legitimately believe that on each given occasion her well-maintained car will start, but nevertheless believe that she will eventually encounter a.. (shrink)

Various theories try to give accounts of how measures of this confidence do or ought to behave, both as far as the internal mental consistency of the agent as ...

We provide self-contained proof of a theorem relating probabilistic coherence of forecasts to their non-domination by rival forecasts with respect to any proper scoring rule. The theorem recapitulates insights achieved by other investigators, and clarifi es the connection of coherence and proper scoring rules to Bregman divergence.