'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.

Richard Jeffrey espoused an antifoundationalist variant of Bayesian thinking that he termed ‘Radical Probabilism’. Radical Probabilism denies both the existence of an ideal, unbiased starting point for our attempts to learn about the world and the dogma of classical Bayesianism that the only justified change of belief is one based on the learning of certainties. Probabilistic judgment is basic and irreducible. Bayesian conditioning is appropriate when interaction with the environment yields new certainty of belief in some proposition but (...) leaves one’s conditional beliefs untouched (the ‘Rigidity’ condition). Although Richard Jeffrey denied the general applicability of this condition, one of his main contributions to probabilistic thinking is a form of belief updating—now typically called ‘Jeffrey conditioning’ or ‘probability kinematics’—that is appropriate in circumstances in which Rigidity is satisfied, but where the interaction causes one to reevaluate one’s probability judgments over some partition of the possibility space without conferring certainty on any particular element. The most familiar occasion for Jeffrey conditioning is receipt of uncertain evidence: things partially perceived or remembered. But it also serves to illuminate belief updating occasioned by a change in one’s degrees of conditional belief, a kind of belief change largely ignored by classical Bayesianism. I argue that such changes in conditional belief can also be basic (in the sense of not being analyzable as a consequence of conditioning on factual information) and offer a kinematical model for a particular kind change in conditional belief. Both are applied to changes in preference. Finally, I argue that Rigidity can fail when changes of belief give inferential grounds for changes in conditional belief (and vice versa). These failures show that conditioning methods are properly regarded, not as valid rules of inference, but as tools in the ‘art of judgment’. (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)

The epistemic modal auxiliaries must and might are vehicles for expressing the force with which a proposition follows from some body of evidence or information. Standard approaches model these operators using quantificational modal logic, but probabilistic approaches are becoming increasingly influential. According to a traditional view, must is a maximally strong epistemic operator and might is a bare possibility one. A competing account—popular amongst proponents of a probabilisitic turn—says that, given a body of evidence, must \ entails that \\) is (...) high but non-maximal and might \ that \\) is significantly greater than 0. Drawing on several observations concerning the behavior of must, might and similar epistemic operators in evidential contexts, deductive inferences, downplaying and retractions scenarios, and expressions of epistemic tension, I argue that those two influential accounts have systematic descriptive shortcomings. To better make sense of their complex behavior, I propose instead a broadly Kratzerian account according to which must \ entails that \ = 1\) and might \ that \ > 0\), given a body of evidence and a set of normality assumptions about the world. From this perspective, must and might are vehicles for expressing a common mode of reasoning whereby we draw inferences from specific bits of evidence against a rich set of background assumptions—some of which we represent as defeasible—which capture our general expectations about the world. I will show that the predictions of this Kratzerian account can be substantially refined once it is combined with a specific yet independently motivated ‘grammatical’ approach to the computation of scalar implicatures. Finally, I discuss some implications of these results for more general discussions concerning the empirical and theoretical motivation to adopt a probabilisitic semantic framework. (shrink)

Probabilism is the view that a rational agent's credences should always be probabilistically coherent. It has been argued that Probabilism follows, given the assumption that an epistemically rational agent ought to try to have credences that represent the world as accurately as possible. The key claim in this argument is that the goal of representing the world as accurately as possible is best served by having credences that are probabilistically coherent. This essay shows that this claim is false. (...) In certain cases, the goal of having accurate credences is best served by being probabilistically incoherent. Assuming that an epistemically rational agent ought to try to have credences that are as accurate as possible, it follows that in certain cases a rational agent ought to have probabilistically incoherent credences. (shrink)

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)

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.

Probabilistic methods are providing new explanatory approaches to fundamental cognitive science questions of how humans structure, process and acquire language. This review examines probabilistic models defined over traditional symbolic structures. Language comprehension and production involve probabilistic inference in such models; and acquisition involves choosing the best model, given innate constraints and linguistic and other input. Probabilistic models can account for the learning and processing of language, while maintaining the sophistication of symbolic models. A recent burgeoning of theoretical developments and online (...) corpus creation has enabled large models to be tested, revealing probabilistic constraints in processing, undermining acquisition arguments based on a perceived poverty of the stimulus, and suggesting fruitful links with probabilistic theories of categorization and ambiguity resolution in perception. (shrink)

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)

We investigate the discrete (finite) case of the Popper–Renyi theory of conditional probability, introducing discrete conditional probabilistic models for knowledge and conditional belief, and comparing them with the more standard plausibility models. We also consider a related notion, that of safe belief, which is a weak (non-negatively introspective) type of “knowledge”. We develop a probabilistic version of this concept (“degree of safety”) and we analyze its role in games. We completely axiomatize the logic of conditional belief, knowledge and safe belief (...) over conditional probabilistic models. We develop a theory of probabilistic dynamic belief revision, introducing probabilistic “action models” and proposing a notion of probabilistic update product, that comes together with appropriate reduction laws. (shrink)

The explanatory role of natural selection is one of the long-term debates in evolutionary biology. Nevertheless, the consensus has been slippery because conceptual confusions and the absence of a unified, formal causal model that integrates different explanatory scopes of natural selection. In this study we attempt to examine two questions: (i) What can the theory of natural selection explain? and (ii) Is there a causal or explanatory model that integrates all natural selection explananda? For the first question, we argue that (...) five explananda have been assigned to the theory of natural selection and that four of them may be actually considered explananda of natural selection. For the second question, we claim that a probabilistic conception of causality and the statistical relevance concept of explanation are both good models for understanding the explanatory role of natural selection. We review the biological and philosophical disputes about the explanatory role of natural selection and formalize some explananda in probabilistic terms using classical results from population genetics. Most of these explananda have been discussed in philosophical terms but some of them have been mixed up and confused. We analyze and set the limits of these problems. (shrink)

Remarkable progress in the mathematics and computer science of probability has led to a revolution in the scope of probabilistic models. In particular, ‘sophisticated’ probabilistic methods apply to structured relational systems such as graphs and grammars, of immediate relevance to the cognitive sciences. This Special Issue outlines progress in this rapidly developing field, which provides a potentially unifying perspective across a wide range of domains and levels of explanation. Here, we introduce the historical and conceptual foundations of the approach, explore (...) how the approach relates to studies of explicit probabilistic reasoning, and give a brief overview of the field as it stands today. (shrink)

We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model- theoretic probabilistic reasoning and to default reasoning in System . In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization of default reasoning in System (...) . That is, we provide a new probabilistic semantics for System , which neither uses infinitesimal probabilities nor atomic bound (or big-stepped) probabilities. These results also provide new algorithms for probabilistic reasoning under coherence and for default reasoning in System , and they give new insight into default reasoning with conditional objects. (shrink)

Are special relativity and probabilism 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" (and is thus incompatible with special relativity), or amounts to a many world universe (which I have discussed, and rejected as too ad hoc to be taken seriously), or fails to have any one definite overall Minkowskian-type space-time structure (and thus differs drastically from special relativity as ordinarily understood). (...) 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)

It seems to be generally accepted that (a) counterfactual conditionals are to be analysed in terms of possible worlds and inter-world relations of similarity and (b) causation is conceptually prior to counterfactuals. I argue here that both (a) and (b) are false. The argument against (a) is not a general metaphysical or epistemological one but simply that, structurally speaking, possible worlds theories are wrong: this is revealed when we try to extend them to cover the case of probabilistic counterfactuals. Indeed (...) a type of counterfactual probability exists which cannot be expressed in possible worlds terms at all. The argument against (b) emerges when we look at the form of an adequate account of both probabilistic and non-probabilistic counterfactuals. I do this by sketching and defending an approach to counterfactuals that, first, invoke a generalized notion of cause as primitive and, secondly, is algorithmic in form: counterfactuals are evaluated algorithmically in terms of other counterfactuals, without vicious circularity. Structures like possible worlds do not play a role either in general truth-conditions or in evaluation. They are simply the wrong sorts of structures. (shrink)

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)

We investigate a basic probabilistic dynamic semantics for a fragment containing conditionals, probability operators, modals, and attitude verbs, with the aim of shedding light on the prospects for adding probabilistic structure to models of the conversational common ground.

A common view among nontheists combines the de jure objection that theism is epistemically unacceptable with agnosticism about the de facto objection that theism is false. Following Plantinga, we can call this a “proper” de jure objection—a de jure objection that does not depend on any de facto objection. In his Warranted Christian Belief, Plantinga has produced a general argument against all proper de jure objections. Here I first show that this argument is logically fallacious (it makes subtle probabilistic fallacies (...) disguised by scope ambiguities), and proceed to lay the groundwork for the construction of actual proper de jure objections. (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)

In this important book, Ellery Eells explores and refines philosophical conceptions of probabilistic causality. In a probabilistic theory of causation, causes increase the probability of their effects rather than necessitate their effects in the ways traditional deterministic theories have specified. Philosophical interest in this subject arises from attempts to understand population sciences as well as indeterminism in physics. Taking into account issues involving spurious correlation, probabilistic causal interaction, disjunctive causal factors, and temporal ideas, Professor Eells advances the analysis of what (...) it is for one factor to be a positive causal factor for another. A salient feature of the book is a theory of token level probabilistic causation in which the evolution of the probability of a later event from an earlier event is central. This will be a book of crucial significance to philosophers of science and metaphysicians; it will also prove stimulating to many economists, psychologists, and physicists. (shrink)

How can different individuals' probability assignments to some events be aggregated into a collective probability assignment? Classic results on this problem assume that the set of relevant events -- the agenda -- is a sigma-algebra and is thus closed under disjunction (union) and conjunction (intersection). We drop this demanding assumption and explore probabilistic opinion pooling on general agendas. One might be interested in the probability of rain and that of an interest-rate increase, but not in the probability of rain or (...) an interest-rate increase. We characterize linear pooling and neutral pooling for general agendas, with classic results as special cases for agendas that are sigma-algebras. As an illustrative application, we also consider probabilistic preference aggregation. Finally, we compare our results with existing results on binary judgment aggregation and Arrovian preference aggregation. This paper is the first of two self-contained, but technically related companion papers inspired by binary judgment-aggregation theory. (shrink)

After clarifying the probabilistic conception of causality suggested by Good (1961-2), Suppes (1970), Cartwright (1979), and Skyrms (1980), we prove a sufficient condition for transitivity of causal chains. The bearing of these considerations on the units of selection problem in evolutionary theory and on the Newcomb paradox in decision theory is then discussed.

Promotion is the relation between an act and a desire that obtains when the act advances or serves the desire. Under what conditions does an act promote a desire? Probabilistic accounts of promotion, the most prominent accounts, analyze promotion in terms of an increase in the probability of the desire’s satisfaction. In this paper, we clarify the promotion relation and explain why probabilistic accounts are attractive. Then we identify two questions probabilistic accounts must answer: the Baseline Question and the Interpretation (...) Question. We discuss and reject the three answers to the Baseline Question found in the literature, and explain the challenge future attempts at answering this question will face. Proponents of probabilistic accounts have not adequately addressed the Interpretation Question. We survey three answers to this question, finding each unsatisfactory. We conclude that no satisfactory probabilistic account has yet been offered, and that there are significant hurdles to providing one in the future. (shrink)

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)

Conceptual combination performs a fundamental role in creating the broad range of compound phrases utilised in everyday language. This article provides a novel probabilistic framework for assessing whether the semantics of conceptual combinations are compositional, and so can be considered as a function of the semantics of the constituent concepts, or not. While the systematicity and productivity of language provide a strong argument in favor of assuming compositionality, this very assumption is still regularly questioned in both cognitive science and philosophy. (...) Additionally, the principle of semantic compositionality is underspecifi ed, which means that notions of both "strong" and "weak" compositionality appear in the literature. Rather than adjudicating between different grades of compositionality, the framework presented here contributes formal methods for determining a clear dividing line between compositional and non-compositional semantics. In addition, we suggest that the distinction between these is contextually sensitive. Compositionality is equated with a joint probability distribution modeling how the constituent concepts in the combination are interpreted. Marginal selectivity is introduced as a pivotal probabilistic constraint for the application of the Bell/CH and CHSH systems of inequalities. Non-compositionality is equated with a failure of marginal selectivity, or violation of either system of inequalities in the presence of marginal selectivity. This means that the conceptual combination cannot be modeled in a joint probability distribution, the variables of which correspond to how the constituent concepts are being interpreted. The formal analysis methods are demonstrated by applying them to an empirical illustration of twenty-four non-lexicalised conceptual combinations. (shrink)

The book can also be used as an excellent text for graduate-level courses in AI, operations research, or applied probability.

Suppose several individuals (e.g., experts on a panel) each assign probabilities to some events. How can these individual probability assignments be aggregated into a single collective probability assignment? This article reviews several proposed solutions to this problem. We focus on three salient proposals: linear pooling (the weighted or unweighted linear averaging of probabilities), geometric pooling (the weighted or unweighted geometric averaging of probabilities), and multiplicative pooling (where probabilities are multiplied rather than averaged). We present axiomatic characterisations of each class of (...) pooling functions (most of them classic, but one new) and argue that linear pooling can be justified procedurally, but not epistemically, while the other two pooling methods can be justified epistemically. The choice between them, in turn, depends on whether the individuals' probability assignments are based on shared information or on private information. We conclude by mentioning a number of other pooling methods. (shrink)

“Probabilistic Causation” designates a group of theories that aim to characterize the relationship between cause and effect using the tools of probability theory. The central idea behind these theories is that causes change the probabilities of their effects. This article traces developments in probabilistic causation, including recent developments in causal modeling. A variety of issues within, and objections to, probabilistic theories of causation will also be discussed.

According to a standard assumption in epistemology, if one only partially believes that p , then one cannot thereby have knowledge that p. For example, if one only partially believes that that it is raining outside, one cannot know that it is raining outside; and if one only partially believes that it is likely that it will rain outside, one cannot know that it is likely that it will rain outside. Many epistemologists will agree that epistemic agents are capable of (...) partial beliefs in addition to full beliefs and that partial beliefs can be epistemically assessed along some dimensions. However, it has been generally assumed that such doxastic attitudes cannot possibly amount to knowledge. In Probabilistic Knowledge, Moss challenges this standard assumption and provides a formidable defense of the claim that probabilistic beliefs—a class of doxastic attitudes including credences and degrees of beliefs—can amount to knowledge too. Call this the probabilistic knowledge claim . Throughout the book, Moss goes to great lengths to show that probabilistic knowledge can be fruitfully applied to a variety of debates in epistemology and beyond. My goal in this essay is to explore a further application for probabilistic knowledge. I want to look at the role of probabilistic knowledge within a “knowledge-centered” psychology—a kind of psychology that assigns knowledge a central stage in explanations of intentional behavior. My suggestion is that Moss’s notion of probabilistic knowledge considerably helps further both a knowledge-centered psychology and a broadly intellectualist picture of action and know-how that naturally goes along with it. At the same time, though, it raises some interesting issues about the notion of explanation afforded by the resulting psychology. (shrink)

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)

It is not only overtly probabilistic illatives like ‘makes it certain that’ but also apparently non-probabilistic ones like ‘therefore’ that have probabilistic import. Illatives like ‘therefore’ convey the meaning that the premise confers on the conclusion a probability not only greater than 0 but also greater than 1/2. But because they do not say whether that probability is equal to or less than 1, these illatives are appropriately called ‘neutral’.

Developments in the Academy from the time of Arcesilaus to that of Carneades and his successors tend to be classified under two heads: scepticism and probabilism. Carneades was principally responsible for the Academy's view of the latter subject, and our sources credit him with an elaborate discussion of it. The evidence furnished by those sources is, however, frequently confusing and sometimes self-contradictory. My aim in this paper is to extract a coherent account of Carneades' theory of probability from the (...) testimony with a further end in view, namely to understand better the uses to which that theory was put by the Academy in its debate with the Stoa. Though it is not its principal object, the investigation should also help make clear how the Academy's scepticism and its probabilism were related to each other as parts of a single consistent practice of philosophy. (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.

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)

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)

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.

Over the years several non-equivalent probabilistic measures of coherence have been discussed in the philosophical literature. In this paper we examine these measures with respect to their empirical adequacy. Using test cases from the coherence literature as vignettes for psychological experiments we investigate whether the measures can predict the subjective coherence assessments of the participants. It turns out that the participants’ coherence assessments are best described by Roche’s coherence measure based on Douven and Meijs’ average mutual support approach and the (...) conditional probability. (shrink)

We report a series of experiments examining whether people ascribe knowledge for true beliefs based on probabilistic evidence. Participants were less likely to ascribe knowledge for beliefs based on probabilistic evidence than for beliefs based on perceptual evidence or testimony providing causal information. Denial of knowledge for beliefs based on probabilistic evidence did not arise because participants viewed such beliefs as unjustified, nor because such beliefs leave open the possibility of error. These findings rule out traditional philosophical accounts for why (...) probabilistic evidence does not produce knowledge. The experiments instead suggest that people deny knowledge because they distrust drawing conclusions about an individual based on reasoning about the population to which it belongs, a tendency previously identified by “judgment and decision making” researchers. Consistent with this, participants were more willing to ascribe knowledge for beliefs based on probabilistic evidence that is specific to a particular case. 2016 APA, all rights reserved). (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.

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..

Real human agents, even when they are rational by everyday standards, sometimes assign different credences to objectively equivalent statements, such as “George Orwell is a writer” and “Eric Arthur Blair is a writer”, or credences less than 1 to necessarily true statements, such as not-yet-proven theorems of arithmetic. Anna Mahtani calls this the phenomenon of “opacity” (a form of hyperintensionality). Opaque credences seem probabilistically incoherent, which goes against a key modelling assumption of probability theory. I sketch a modelling strategy for (...) capturing opaque credence assignments without abandoning probabilistic coherence. I draw on ideas from judgment-aggregation theory, where we face similar challenges of defining the “objects of judgment”. (shrink)

We often have some reason to do actions insofar as they promote outcomes or states of affairs, such as the satisfaction of a desire. But what is it to promote an outcome? I defend a new version of 'probabilism about promotion'. According to Minimal Probabilistic Promotion, we promote some outcome when we make that outcome more likely than it would have been if we had done something (anything) else. This makes promotion easy and reasons cheap.

According to Nancy Cartwright, a causal law holds just when a certain probabilistic condition obtains in all test situations which in turn satisfy a set of background conditions. These background conditions are shown to be inconsistent and, on separate account, logically incoherent. I offer a corrective reformulation which also incorporates a strategy for problems like Hesslow's thrombosis case. I also show that Cartwright's recent argument for modifying the condition to appeal to singular causes fails.Proposed modifications of the theory's probabilistic condition (...) to handle effects with extreme probabilities (0 or 1) are found unsatisfactory. I propose a unified solution which also handles extreme causes. Undefined conditional probabilities give rise to three good, but non-equivalent, ways of formulating the theory. Various formulations appear in the literature. I give arguments to eliminate all but one candidate. Finally, I argue for a crucial new condition clause, and show how to extend the results beyond a simple probabilistic framework. (shrink)

This paper examines a promising probabilistic theory of singular causation developed by David Lewis. I argue that Lewis' theory must be made more sophisticated to deal with certain counterexamples involving pre-emption. These counterexamples appear to show that in the usual case singular causation requires an unbroken causal process to link cause with effect. I propose a new probabilistic account of singular causation, within the framework developed by Lewis, which captures this intuition.

This is part A of a paper in which we defend a semantics for counterfactuals which is probabilistic in the sense that the truth condition for counterfactuals refers to a probability measure. Because of its probabilistic nature, it allows a counterfactual ‘ifAthenB’ to be true even in the presence of relevant ‘Aand notB’-worlds, as long such exceptions are not too widely spread. The semantics is made precise and studied in different versions which are related to each other by representation theorems. (...) Despite its probabilistic nature, we show that the semantics and the resulting system of logic may be regarded as a naturalistically vindicated variant of David Lewis’ truth-conditional semantics and logic of counterfactuals. At the same time, the semantics overlaps in various ways with the non-truth-conditional suppositional theory for conditionals that derives from Ernest Adams’ work. We argue that counterfactuals have two kinds of pragmatic meanings and come attached with two types of degrees of acceptability or belief, one being suppositional, the other one being truth based as determined by our probabilistic semantics; these degrees could not always coincide due to a new triviality result for counterfactuals, and they should not be identified in the light of their different interpretation and pragmatic purpose. However, for plain assertability the difference between them does not matter. Hence, if the suppositional theory of counterfactuals is formulated with sufficient care, our truth-conditional theory of counterfactuals is consistent with it. The results of our investigation are used to assess a claim considered by Hawthorne and Hájek, that is, the thesis that most ordinary counterfactuals are false. (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)