In this article, I explain how a variant of David Miller's argument concerning the language dependence of the accuracy of predictions can be applied to Joyce's notion of the accuracy of “estimates of numerical truth-values”. This leads to a potential problem for Joyce's accuracy-dominance-based argument for the conclusion that credences should obey the probability calculus.

This paper considers a puzzling conflict between two positions that are each compelling: it is irrational for an agent to pay to avoid `free' evidence before making a decision, and rational agents may have imprecise beliefs and/or desires. Indeed, we show that Good's theorem concerning the invariable choice-worthiness of free evidence does not generalise to the imprecise realm, given the plausible existing decision theories for handling imprecision. A key ingredient in the analysis, and a potential source of controversy, is the (...) general approach taken for resolving sequential decision problems { we make explicit what the key alternatives are and defend our own approach. Furthermore, we endorse a resolution of the aforementioned puzzle { we privilege decision theories that merely permit avoiding free evidence over decision theories for which avoiding free evidence is uniquely admissible. Finally, we situate this particular result about free evidence within the broader `dynamic-coherence' literature. (shrink)

The same two kinds of conditional connections in the world, each dependent on the situation, hold between each event in certain sets of events that we can call causal circumstances for the lighting. A causal circumstance cc) included the event that for some reason we pick out and call the cause -- the striking s).

In a recent paper, Pettigrew reports a generalization of the celebrated accuracy-dominance theorem due to Predd et al., but Pettigrew’s proof is incorrect. I will explain the mistakes and provide a correct proof.

Dutch Book Arguments. B is susceptibility to sure monetary loss (in a certain betting set-up), and F is the formal role played by non-Pr b’s in the DBT and the Converse DBT. Representation Theorem Arguments. B is having preferences that violate some of Savage’s axioms (and/or being unrepresentable as an expected utility maximizer), and F is the formal role played by non-Pr b’s in the RT.

Adopting a central feature of Stoic epistemology, Descartes treated belief as action that might be undertaken wisely or rashly, and enunciated a method for avoiding false belief, a discipline of the will “to include nothing more in my judgments than what presented itself to my mind with such clarity and distinctness that I would have no occasion to put it in doubt”.1 He called such acts of the will “affirmations”, i.e., acts of accepting sentences or propositions as true.

The aim of the paper is to develop general criteria of argumentative validity and adequacy for probabilistic arguments on the basis of the epistemological approach to argumentation. In this approach, as in most other approaches to argumentation, proabilistic arguments have been neglected somewhat. Nonetheless, criteria for several special types of probabilistic arguments have been developed, in particular by Richard Feldman and Christoph Lumer. In the first part (sects. 2-5) the epistemological basis of probabilistic arguments is discussed. With regard to the (...) philosophical interpretation of probabilities a new subjectivist, epistemic interpretation is proposed, which identifies probabilities with tendencies of evidence (sect. 2). After drawing the conclusions of this interpretation with respect to the syntactic features of the probability concept, e.g. one variable referring to the data base (sect. 3), the justification of basic probabilities (priors) by judgements of relative frequency (sect. 4) and the justification of derivative probabilities by means of the probability calculus are explained (sect. 5). The core of the paper is the definition of '(argumentatively) valid derivative probabilistic arguments', which provides exact conditions for epistemically good probabilistic arguments, together with conditions for the adequate use of such arguments for the aim of rationally convincing an addressee (sect. 6). Finally, some measures for improving the applicability of probabilistic reasoning are proposed (sect. 7). (shrink)

'The Probabilistic Mind' is a follow-up to the influential and highly cited 'Rational Models of Cognition'. It brings together developments in understanding how, and how far, high-level cognitive processes can be understood in rational terms, and particularly using probabilistic Bayesian methods.

The debate on probabilistic measures of coherence flourishes for about 15 years now. Initiated by papers that have been published around the turn of the millennium, many different proposals have since then been put forward. This contribution is partly devoted to a reassessment of extant coherence measures. Focusing on a small number of reasonable adequacy constraints I show that (i) there can be no coherence measure that satisfies all constraints, and that (ii) subsets of these adequacy constraints motivate two different (...) classes of coherence measures. These classes do not coincide with the common distinction between coherence as mutual support and coherence as relative set-theoretic overlap. Finally, I put forward arguments to the effect that for each such class of coherence measures there is an outstanding measure that outperforms all other extant proposals. One of these measures has recently been put forward in the literature, while the other one is based on a novel probabilistic measure of confirmation. (shrink)

The framework of elementary probabilistic operations (EPO) explains the structure of elementary probabilistic reasoning tasks as well as people’s performance on these tasks. The framework comprises three components: (a) Three types of probabilities: joint, marginal, and conditional probabilities; (b) three elementary probabilistic operations: combination, marginalization, and conditioning, and (c) quantitative inference schemas implementing the EPO. The formal part of the EPO framework is a computational level theory that provides a problem space representation and a classification of elementary probabilistic problems based (...) on computational requirements for solving a problem. According to the EPO framework, current methods for improving probabilistic reasoning are of two kinds: First, reduction of Bayesian problems to a type of probabilistic problems requiring less conceptual and procedural competencies. Second, enhancing people’s utilization competence by fostering the application of quantitative inference schemas. The approach suggests new applications, including the teaching of probabilistic reasoning, using analogical problem solving in probabilistic reasoning, and new methods for analyzing errors in probabilistic problem solving. (shrink)

Several authors have investigated the question of whether canonical logic-based accounts of belief revision, and especially the theory of AGM revision operators, are compatible with the dynamics of Bayesian conditioning. Here we show that Leitgeb's stability rule for acceptance, which has been offered as a possible solution to the Lottery paradox, allows to bridge AGM revision and Bayesian update: using the stability rule, we prove that AGM revision operators emerge from Bayesian conditioning by an application of the principle of maximum (...) entropy. In situations of information loss, or whenever the agent relies on a qualitative description of her information state - such as a plausibility ranking over hypotheses, or a belief set - the dynamics of AGM belief revision are compatible with Bayesian conditioning; indeed, through the maximum entropy principle, conditioning naturally generated AGM revision operators. This mitigates an impossibility theorem of Lin and Kelly for tracking Bayesian conditioning with AGM revision, and suggests an approach to the compatibility problem that highlights the information loss incurred by acceptance rules in passing from probabilistic to qualitative representations of beliefs. (shrink)

In this paper I expound an argument which seems to establish that probabilism and special relativity are incompatible. I examine the argument critically, and consider its implications for interpretative problems of quantum theory, and for theoretical physics as a whole.

Traditional philosophical discussions of knowledge have focused on the epistemic status of full beliefs. In this book, Moss argues that in addition to full beliefs, credences can constitute knowledge. For instance, your .4 credence that it is raining outside can constitute knowledge, in just the same way that your full beliefs can. In addition, you can know that it might be raining, and that if it is raining then it is probably cloudy, where this knowledge is not knowledge of propositions, (...) but of probabilistic contents. -/- The notion of probabilistic content introduced in this book plays a central role not only in epistemology, but in the philosophy of mind and language as well. Just as tradition holds that you believe and assert propositions, you can believe and assert probabilistic contents. Accepting that we can believe, assert, and know probabilistic contents has significant consequences for many philosophical debates, including debates about the relationship between full belief and credence, the semantics of epistemic modals and conditionals, the contents of perceptual experience, peer disagreement, pragmatic encroachment, perceptual dogmatism, and transformative experience. In addition, accepting probabilistic knowledge can help us discredit negative evaluations of female speech, explain why merely statistical evidence is insufficient for legal proof, and identify epistemic norms violated by acts of racial profiling. Hence the central theses of this book not only help us better understand the nature of our own mental states, but also help us better understand the nature of our responsibilities to each other. (shrink)

The concept of time emerges as an ordering structure in a classical statistical ensemble. Probability distributions p τ (t) at a given time t obtain by integrating out the past and future. We discuss all-time probability distributions that realize a unitary time evolution as described by rotations of the real wave function $q_{\tau}(t)=\pm \sqrt{p_{\tau}(t)}$ . We establish a map to quantum physics and the Schrödinger equation. Suitable classical observables are mapped to quantum operators. The non-commutativity of the operator product is (...) traced back to the incomplete statistics of the local-time subsystem. Our investigation of classical statistics is based on two-level observables that take the values one or zero. Then the wave functions can be mapped to elements of a Grassmann algebra. Quantum field theories for fermions arise naturally from our formulation of probabilistic time. (shrink)

In classical physics, probabilistic or statistical knowledge has been always related to ignorance or inaccurate subjective knowledge about an actual state of affairs. This idea has been extended to quantum mechanics through a completely incoherent interpretation of the Fermi-Dirac and Bose-Einstein statistics in terms of "strange" quantum particles. This interpretation, naturalized through a widespread "way of speaking" in the physics community, contradicts Born's physical account of Ψ as a "probability wave" which provides statistical information about outcomes that, in fact, cannot (...) be interpreted in terms of 'ignorance about an actual state of affairs'. In the present paper we discuss how the metaphysics of actuality has played an essential role in limiting the possibilities of understating things differently. We propose instead a metaphysical scheme in terms of powers with definite potentia which allows us to consider quantum probability in a new light, namely, as providing objective knowledge about a potential state of affairs. (shrink)

Probabilistic realism and syntactical positivism were two among outdated theories that Feigl criticised on account of their semantical poverty. In this paper, I argue that a refined version of probabilistic realism, which relies on what Feigl specified as the pragmatic description of the symbolic behaviour of scientists’ estimations and foresight, is defendable. This version of statistical realism does not need to make the plausibility of realist thesis dependent on the conventional acceptance of a constructed semantic metalanguage. I shall rely on (...) the Prediction Error Minimisation theory to support my probabilistic version of realism with a scientifically-informed and naturalistically plausible statistical account of the theories-world relationship which has a pragmatic ring to it. (shrink)

There has been a probabilistic turn in contemporary cognitive science. Far and away, most of the work in this vein is Bayesian, at least in name. Coinciding with this development, philosophers have increasingly promoted Bayesianism as the best normative account of how humans ought to reason. In this paper, we make a push for exploring the probabilistic terrain outside of Bayesianism. Non-Bayesian, but still probabilistic, theories provide plausible competitors both to descriptive and normative Bayesian accounts. We argue for this general (...) idea via recent work on explanationist models of updating, which are fundamentally probabilistic but assign a substantial, non-Bayesian role to explanatory considerations. (shrink)

While in principle probabilistic logics might be applied to solve a range of problems, in practice they are rarely applied at present. This is perhaps because they seem disparate, complicated, and computationally intractable. However, we shall argue in this programmatic paper that several approaches to probabilistic logic into a simple unifying framework: logically complex evidence can be used to associate probability intervals or probabilities with sentences.

The central problem with Bayesian philosophy of science is that it cannot take account of the relevance of simplicity and unification to confirmation, induction, and scientific inference. The standard Bayesian folklore about factoring simplicity into the priors, and convergence theorems as a way of grounding their objectivity are some of the myths that Earman's book does not address adequately. 1Review of John Earman: Bayes or Bust?, Cambridge, MA. MIT Press, 1992, £33.75cloth.

Natural information refers to the information carried by natural signs such as that smoke is thought to carry natural information about fire. A number of influential philosophers have argued that natural information can also be utilized in a theory of mental content. The most widely discussed account of natural information holds that it results from an extremely strong relation between sign and signified. Critics have responded that it is doubtful that there are many strong relations of this sort in the (...) natural world due to variability between signs and signified. In light of this observation, a promising suggestion is that much of the interesting natural information carried by natural signs is really information with a probabilistic content. However, Dretske’s theory cannot account for this information because it would require implausible second order objective probabilities. Given the most plausible understanding of the probabilities involved here, I argue that it is only sequences of traditional natural signs that carry this probabilistic information. Several implications of this idea will be explored. (shrink)

We introduce a probabilistic extension of propositional intuitionistic logic. The logic allows making statements such as P≥sα, with the intended meaning “the probability of truthfulness of α is at least s”. We describe the corresponding class of models, which are Kripke models with a naturally arising notion of probability, and give a sound and complete infinitary axiomatic system. We prove that the logic is decidable.

The paper offers a formalization of reasoning about distributed multi-agent systems. The presented propositional probabilistic temporal epistemic logic $\textbf {PTEL}$ is developed in full detail: syntax, semantics, soundness and strong completeness theorems. As an example, we prove consistency of the blockchain protocol with respect to the given set of axioms expressed in the formal language of the logic. We explain how to extend $\textbf {PTEL}$ to axiomatize the corresponding first-order logic.

Words are the essence of communication: They are the building blocks of any language. Learning the meaning of words is thus one of the most important aspects of language acquisition: Children must first learn words before they can combine them into complex utterances. Many theories have been developed to explain the impressive efficiency of young children in acquiring the vocabulary of their language, as well as the developmental patterns observed in the course of lexical acquisition. A major source of disagreement (...) among the different theories is whether children are equipped with special mechanisms and biases for word learning, or their general cognitive abilities are adequate for the task. We present a novel computational model of early word learning to shed light on the mechanisms that might be at work in this process. The model learns word meanings as probabilistic associations between words and semantic elements, using an incremental and probabilistic learning mechanism, and drawing only on general cognitive abilities. The results presented here demonstrate that much about word meanings can be learned from naturally occurring child-directed utterances (paired with meaning representations), without using any special biases or constraints, and without any explicit developmental changes in the underlying learning mechanism. Furthermore, our model provides explanations for the occasionally contradictory child experimental data, and offers predictions for the behavior of young word learners in novel situations. (shrink)

The notions of psychological similarity and probabilistic learning are key posits in cognitive, computational, and developmental psychology and in machine learning. However, their explanatory relationship is rarely made explicit within and across these research fields. This opinionated review critically evaluates how these notions can mutually inform each other within computational cognitive science. Using probabilistic models of concept learning as a case study, I argue that two notions of psychological similarity offer important normative constraints to guide modelers’ interpretations of representational primitives. (...) In particular, the two notions furnish probabilistic models of cognition with meaningful interpretations of what the associated subjective probabilities in the model represent and how they attach to experiences from which the agent learns. Similarity representations thereby provide probabilistic models with cognitive, as opposed to purely mathematical, content. (shrink)

– Foundation: Probabilistic Confirmation (c) from a Logical POV ∗ cph, eq as a “relevant” quantitative generalization of pe  hq ∗ cph, eq, so understood, is not Prpe  hq or Prph | eq, etc. ∗ cph, eq is something akin (ordinally) to the likelihood ratio..

Let E be a set of n propositions E1, ..., En. We seek a probabilistic measure C(E) of the ‘degree of coherence’ of E. Intuitively, we want C to be a quantitative, probabilistic generalization of the (deductive) logical coherence of E. So, in particular, we require C to satisfy the following..

This paper develops a probabilistic reconstruction of the No Miracles Argument in the debate between scientific realists and anti-realists. The goal of the paper is to clarify and to sharpen the NMA by means of a probabilistic formalization. In particular, we demonstrate that the persuasive force of the NMA depends on the particular disciplinary context where it is applied, and the stability of theories in that discipline. Assessments and critiques of "the" NMA, without reference to a particular context, are misleading (...) and should be relinquished. This result has repercussions for recent anti-realist arguments, such as the claim that the NMA commits the base rate fallacy. It also helps to explain the persistent disagreement between realists and anti-realists. (shrink)

A probabilistic theory of causation is a theory which holds that the central feature of causation is that causes raise the probability of their effects. In this dissertation, I defend Hans Reichenbach's original version of the probabilistic theory of causation, which analyses causal relations in terms of a three place statistical betweenness relation. Unlike most discussions of this theory, I hold that the statistical relation should be taken as a sufficient, but not as a necessary , condition for causal betweenness. (...) With this difference in interpretation, Reichenbach's theory is shown to be immune to all of the criticisms which have been raised against it in the last fifty years. ;Reichenbach's main purpose in defending a probabilistic theory of causation was to use it in giving an analysis of the direction of time. I defend this view, arguing that the arrow of causation is more basic than any of the other arrows of time---metaphysical, psychological or physical. In particular, I argue against the popular view that the direction of time is given by the physical fact that entropy only increases in one direction. I further show that the probabilistic theory of causation is particularly suited to the task of analysing the various arrows of time. In my final chapter, I also suggest that the probabilistic theory of causation may be fruitfully applied to the analysis of some important puzzles in the interpretation of quantum mechanics. (shrink)

Orthodox Probabilists hold that an inquirer ought to harbor a precise degree of confidence in each hypothesis about which she is concerned. Modest Probabilism is one of a family doctrines inspired by the thought that Orthodox Probabilists are thereby demanding that an inquirer effect a precision that is often unwarranted by her evidence. The purpose of this essay is (i) to explain the particular way in which Modest Probabilism answers to this thought, and (ii) to address an alleged (...) counterexample to Modest Probabilism meant to offer proof that Modest Probabilism is no better than its orthodox predecessor at avoiding unwarranted precision. (shrink)

I put forward a micro realistic, probabilistic version of quantum theory, which specifies the precise nature of quantum entities thus solving the quantum wave/particle dilemma, and which both reproduces the empirical success of orthodox quantum theory, and yields predictions that differ from orthodox quantum theory for as yet unperformed experiments.

Are probabilism and special relativity compatible? Dieks argues that they are. But the possible universe he specifies, designed to exemplify both probabilism and special relativity, either incorporates a universal “now”, or amounts to a many world universe, or fails to have any one definite overall Minkowskian-type space-time structure. Probabilism and special relativity appear to be incompatible after all. What is at issue is not whether “the flow of time” can be reconciled with special relativity, but rather whether (...) explicitly probabilistic versions of quantum theory should be rejected because of incompatibility with special relativity. (shrink)

In Probabilistic Knowledge Sarah Moss proposes that our credences and subjective probability judgments (SPJs) can constitute knowledge. Mossean probabilistic knowledge is grounded in probabilistic beliefs that are justified, true, and unGettiered. In this paper I aim to address and solve two challenges that arise in the vicinity of the factivity condition for probabilistic knowledge: the factivity challenge and the challenge from probabilistic arguments from ignorance (probabilistic AIs). I argue that while Moss's deflationary solution to the factivity challenge formally works, it (...) leaves us ill-equipped to handle probabilistic AIs. An account of probabilistic knowledge that cannot overcome probabilistic AIs makes knowledge of thoroughly probabilistic contents a rare and unstable phenomenon, at best, or, at worst, impossible. I hold that establishing a metaphysically enriched account of probabilistic truth is therefore mandatory. I go on to develop a truth-conditional approach on probabilistic factivity that is relativistic in its nature and centers on objective chances. I show that while the approach is still compatible with Moss's overall semantics for probabilistic knowledge, it provides us with a simple but forceful answer to probabilistic AIs. (shrink)

The problems of access—retrieving linguistic structure from some mental grammar —and disambiguation—choosing among these structures to correctly parse ambiguous linguistic input—are fundamental to language understanding. The literature abounds with psychological results on lexical access, the access of idioms, syntactic rule access, parsing preferences, syntactic disambiguation, and the processing of garden‐path sentences. Unfortunately, it has been difficult to combine models which account for these results to build a general, uniform model of access and disambiguation at the lexical, idiomatic, and syntactic levels. (...) For example, psycholinguistic theories of lexical access and idiom access and parsing theories of syntactic rule access have almost no commonality in methodology or coverage of psycholinguistic data. This article presents a single probabilistic algorithm which models both the access and disambiguation of linguistic knowledge. The algorithm is based on a parallel parser which ranks constructions for access, and interpretations for disambiguation, by their conditional probability. Low‐ranked constructions and interpretations are pruned through beam‐search; this pruning accounts, among other things, for the garden‐path effect. I show that this motivated probabilistic treatment accounts for a wide variety of psycholinguistic results, arguing for a more uniform representation of linguistic knowledge and for the use of probabilistically‐enriched grammars and interpreters as models of human knowledge of and processing of language. (shrink)

A formulation of probabilistic causality is given in terms of the theory of abstract dynamical systems. Causal factors are identified as invariants of motion of a system. Repetition of an experiment leads to the notion of stationarity, and causal factors yield a decomposition of the stationary probability law of the experiment into ergodic components. In these, statistical behaviour is uniform. Control of identified causal factors leads to a corresponding statistical law for the events, which is offered as a notion of (...) probabilistic causality. After a suggestion by Feller, randomization is identified as mixing, formulated in above terms. (shrink)

This study presents a probabilistic model of melody perception, which infers the key of a melody and also judges the probability of the melody itself. The model uses Bayesian reasoning: For any “surface” pattern and underlying “structure,” we can infer the structure maximizing P(structure|surface) based on knowledge of P(surface, structure). The probability of the surface can then be calculated as ∑ P(surface, structure), summed over all structures. In this case, the surface is a pattern of notes; the structure is a (...) key. A generative model is proposed, based on three principles: (a) melodies tend to remain within a narrow pitch range; (b) note‐to‐note intervals within a melody tend to be small; and (c) notes tend to conform to a distribution (or key profile) that depends on the key. The model is tested in three ways. First, it is tested on its ability to identify the keys of a set of folksong melodies. Second, it is tested on a melodic expectation task in which it must judge the probability of different notes occurring given a prior context; these judgments are compared with perception data from a melodic expectation experiment. Finally, the model is tested on its ability to detect incorrect notes in melodies by assigning them lower probabilities than the original versions. (shrink)

This paper discusses Simpson's paradox and the problem of positive relevance in probabilistic causality. It is argued that Cartwright's solution to Simpson's paradox fails because it ignores one crucial form of the paradox. After clarifying different forms of the paradox, it is shown that any adequate solution to the paradox must allow a cause to be both a negative cause and a positive cause of..

Modus ponens (from A and “if A then C” infer C) is one of the most basic inference rules. The probabilistic modus ponens allows for managing uncertainty by transmitting assigned uncertainties from the premises to the conclusion (i.e., from P(A) and P(C|A) infer P(C)). In this paper, we generalize the probabilistic modus ponens by replacing A by the conditional event A|H. The resulting inference rule involves iterated conditionals (formalized by conditional random quantities) and propagates previsions from the premises to the (...) conclusion. Interestingly, the propagation rules for the lower and the upper bounds on the conclusion of the generalized probabilistic modus ponens coincide with the respective bounds on the conclusion for the (non-nested) probabilistic modus ponens. (shrink)

An extension of the propositional probability logic \ given in Ognjanović et al. that allows mixing of propositional formulas and probabilistic formulas is introduced. We describe the corresponding class of models, and we show that the problem of deciding satisfiability is in NP. We provide infinitary axiomatization for the logic and we prove that the axiomatization is sound and strongly complete.

Probabilistic belief contraction has been a much neglected topic in the field of probabilistic reasoning. This is due to the difficulty in establishing a reasonable reversal of the effect of Bayesian conditionalization on a probabilistic distribution. We show that indifferent contraction, a solution proposed by Ramer to this problem through a judicious use of the principle of maximum entropy, is a probabilistic version of a full meet contraction. We then propose variations of indifferent contraction, using both the Shannon entropy measure (...) as well as the Hartley entropy measure, with an aim to avoid excessive loss of beliefs that full meet contraction entails. (shrink)

The question of how the probabilistic opinions of different individuals should be aggregated to form a group opinion is controversial. But one assumption seems to be pretty much common ground: for a group of Bayesians, the representation of group opinion should itself be a unique probability distribution, 410–414, [45]; Bordley Management Science, 28, 1137–1148, [5]; Genest et al. The Annals of Statistics, 487–501, [21]; Genest and Zidek Statistical Science, 114–135, [23]; Mongin Journal of Economic Theory, 66, 313–351, [46]; Clemen and (...) Winkler Risk Analysis, 19, 187–203, [7]; Dietrich and List [14]; Herzberg Theory and Decision, 1–19, [28]). We argue that this assumption is not always in order. We show how to extend the canonical mathematical framework for pooling to cover pooling with imprecise probabilities by employing set-valued pooling functions and generalizing common pooling axioms accordingly. As a proof of concept, we then show that one IP construction satisfies a number of central pooling axioms that are not jointly satisfied by any of the standard pooling recipes on pain of triviality. Following Levi, 3–11, [39]), we also argue that IP models admit of a much better philosophical motivation as a model of rational consensus. (shrink)

In Michael Caie's article “Rational Probabilistic Incoherence,” Caie argues that in light of certain situations involving self-reference, it is sometimes rational to have probabilistically incoherent credences. This essay further considers his arguments. It shows that probabilism isn't to blame for the failure of rational introspection and that Caie's modified accuracy criterion conflicts with Dutch book considerations, is scoring rule dependent, and leads to the failure of rational introspection.

“Epistemic safety” refers to an epistemic status in which the subject acquires true beliefs without involving epistemic luck. There is a tradition of cashing out safety-defining modality in terms of possible world semantics, and even Julian Dutant's and Martin Smith's normalcy-based notions of safety also take this semantics as a significant component of them. However, such an approach has to largely depend on epistemologists’ ad hoc intuitions on how to individuate possible worlds and how to pick out “close” worlds. In (...) contrast, I propose a probabilistic approach to safety to maximally preclude the preceding type of ad hoc-ness. The main idea is as follows: Each epistemic vignette wherein a subject S holds a true belief p has to be evaluated by a safety-ascriber, hence, S holds a true belief p safely iff according to the safety-ascriber's evaluation, the probability of the occurrence of the truth-maker of p is above a pre-fixed “safety threshold”. My theory will be applied to Lottery Cases, Gettierized Cases and Skeptical Cases to test the scope of its applicability. (shrink)

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.