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

Four important arguments for probabilism—the Dutch Book, representation theorem, calibration, and gradational accuracy arguments—have a strikingly similar structure. Each begins with a mathematical theorem, a conditional with an existentially quantified consequent, of the general form: if your credences are not probabilities, then there is a way in which your rationality is impugned. Each argument concludes that rationality requires your credences to be probabilities. I contend that each argument is invalid as formulated. In each case there is a mirror-image theorem and (...) a corresponding argument of exactly equal strength that concludes that rationality requires your credences not to be probabilities. Some further consideration is needed to break this symmetry in favour of probabilism. (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)

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)

A recent development in the cognitive science of reasoning has been the emergence of a probabilistic approach to the behaviour observed on ostensibly logical tasks. According to this approach the errors and biases documented on these tasks occur because people import their everyday uncertain reasoning strategies into the laboratory. Consequently participants' apparently irrational behaviour is the result of comparing it with an inappropriate logical standard. In this article, we contrast the probabilistic approach with other approaches to explaining (...) rationality, and then show how it has been applied to three main areas of logical reasoning: conditional inference, Wason's selection task and syllogistic reasoning. (shrink)

Decision-theoretic representation theorems have been developed and appealed to in the service of two important philosophical projects: in attempts to characterise credences in terms of preferences, and in arguments for probabilism. Theorems developed within the formal framework that Savage developed have played an especially prominent role here. I argue that the use of these ‘Savagean’ theorems create significant difficulties for both projects, but particularly the latter. The origin of the problem directly relates to the question of whether we can have (...) credences regarding acts currently under consideration and the consequences which depend on those acts; I argue that such credences are possible. Furthermore, I argue that attempts to use Jeffrey’s non-Savagean theorem in the service of these two projects may not fare much better. (shrink)

Sarah Moss argues that degrees of belief, or credences, can amount to knowledge in much the way that full beliefs can. This essay explores a new kind of objective Bayesianism designed to take us some way toward securing such knowledge-constituting credences, or "probabilistic knowledge." Whatever else it takes for an agent's credences to amount to knowledge, their success, or accuracy, must be the product of _cognitive ability_ or _skill_. The brand of Bayesianism developed here helps ensure this ability condition (...) is satisfied. Cognitive ability, in turn, helps make credences valuable in other ways: it helps mitigate their dependence on epistemic luck, for example. What we end up with, at the end of the day, are credences that are particularly good candidates for constituting probabilistic knowledge. What's more, examining the character of these credences teaches us something important about what the pursuit of probabilistic knowledge demands from us. It does _not_ demand that we give hypotheses equal _treatment_, by affording them equal credence. Rather, it demands that we give them equal _consideration_, by affording them an equal chance of being discovered. (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)

Moss (2018) argues that rational agents are best thought of not as having degrees of belief in various propositions but as having beliefs in probabilistic contents, or probabilistic beliefs. Probabilistic contents are sets of probability functions. Probabilistic belief states, in turn, are modeled by sets of probabilistic contents, or sets of sets of probability functions. We argue that this Mossean framework is of considerable interest quite independently of its role in Moss’ account of probabilistic (...) knowledge or her semantics for epistemic modals and probability operators. It is an extremely general model of uncertainty. Indeed, it is at least as general and expressively powerful as every other current imprecise probability framework, including lower probabilities, lower previsions, sets of probabilities, sets of desirable gambles, and choice functions. In addition, we partially answer an important question that Moss leaves open, viz., why should rational agents have consistent probabilistic beliefs? We show that an important subclass of Mossean believers avoid Dutch bookability iff they have consistent probabilistic beliefs. (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)

Mental causation is notoriously threatened by the causal exclusion argument. A prominent strategy to save mental causation from causal exclusion consists in subscribing to an interventionist account of causation. This move has, however, recently been challenged by several authors. In this paper, we do two things: We (i) develop what we consider to be the strongest version of the interventionist causal exclusion argument currently on the market and (ii) propose a new way how it can in principle be overcome. In (...) particular, we propose to replace strict supervenience in the assumption that the mental supervenes on the physical by probabilistic supervenience and show how this move has the potential to license the inference to mental causation. Finally, we argue that probabilistic supervenience captures some of the most important intuitions that strict supervenience captures and discuss possible objections to weakening strict supervenience in the way we suggest. (shrink)

This paper examines Patrick Suppes’ probabilistic theory of causality understood as a theory of causal inference, and draws some lessons for empirical economics and contemporary debates in the foundations of econometrics. It argues that a standard method of empirical economics, multiple regression, is inadequate for most but the simplest applications, that the Bayes’ nets approach, which can be understood as a generalisation of Suppes’ theory, constitutes a considerable improvement but is still subject to important limitations, and that the currently (...) fashionable ‘design-based approach’ suffers from the same flaws Suppes anticipated a long time ago. It then sketches an alternative in response, one that differs drastically from the formalisms Suppes endorsed but is consistent with his pragmatic general take on science. (shrink)

In this essay, I analyze and critique Richard Jeffrey's radical probabilism. The basic theses defining it are examined, particularly the idea that probabilistic coherence involves a kind of "consistency." The main challenges to Jeffrey's view are (1) that there is an inconsistency between regarding probabilities as subjective and some probabilistic judgments as better than others, and (2) that decision theory so conceived has no normative import. I argue that both of these challenges can be met.

Four important arguments for probabilism—the Dutch Book, representation theorem, calibration, and gradational accuracy arguments—have a strikingly similar structure. Each begins with a mathematical theorem, a conditional with an existentially quantified consequent, of the general form: if your credences are not probabilities, then there is a way in which your rationality is impugned.Each argument concludes that rationality requires your credences to be probabilities.I contend that each argument is invalid as formulated. In each case there is a mirror-image theorem and a corresponding (...) argument of exactly equal strength that concludes that rationality requires your credences not to be probabilities. Some further consideration is needed to break this symmetry in favour of probabilism. I discuss the extent to which the original arguments can be buttressed.1. Introduction2. The Dutch Book Argument2.1. Saving the Dutch Book argument2.2. ‘The Dutch Book argument merely dramatizes an inconsistency in the attitudes of an agent whose credences violate probability theory’3. Representation Theorem-based Arguments4. The Calibration Argument5. The Gradational Accuracy Argument6. Conclusion. (shrink)

This work is in two parts. The main aim of part 1 is a systematic examination of deductive, probabilistic, inductive and purely inductive dependence relations within the framework of Kolmogorov probability semantics. The main aim of part 2 is a systematic comparison of (in all) 20 different relations of probabilistic (in)dependence within the framework of Popper probability semantics (for Kolmogorov probability semantics does not allow such a comparison). Added to this comparison is an examination of (in all) 15 (...) purely inductive dependence relations. ————Part 1 leads in an axiomatic step-by-step development from the elementary classical truth value semantics of a sentential-logical language, called ‘L’, (chapter 1) to the elementary Kolmogorov probability semantics of L (chapter 2), which is then extended to four axiomatic semantical theories of dependence relations between the formulae of L. First the elementary Kolmogorov probability semantics of L is extended to a theory, called ‘Kdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 3). Then Kdd is extended to a theory, called ‘Kpd1’, of the degree to which formulae of L probabilistically depend on each other in regard to a given probability distribution on the set of all formulae of L (chapter 4). Kpd1, in its turn, gets extended to a theory, called ‘Kpd2’, of the relations of probabilistic dependence and independence, relativized to unary Kolmogorov probability functions defined on L (chapter 5). Then Kpd2 is extended to a theory, called ‘Kid’, of the relations of inductive dependence and inductive independence, again relativized to unary Kolmogorov probability functions defined on L (chapter 6). Finally, Kid is extended to a theory, called ‘Kpid’, of the relations of purely inductive positive and negative dependence, relativized to unary Kolmogorov probability functions defined on L (chapter 7). ——Chapter 1, which deals with the familiar notions of truth value functions, tautologies, consequence relations and relations of logical opposition, is naturally the shortest chapter of part 1.——In chapter 2, the elementary classical semantics of L is extended to the elementary Kolmogorov probability semantics of L, i.e. to an axiomatic theory of unary and of binary Kolmogorov probability functions defined on the set of formulae of L. Because of the elementary character of this theory, chapter 2 is also rather short.——Chapter 3 introduces the first theory on dependence relations, to wit: Kdd, the theory of deductive (in)dependence between formulae of L. I follow here the well-known idea of Popper and Miller, who have used it in a famous discussion on the nature of probabilistic support for their arguments that probabilistic support is deductive, not inductive. I develop Kdd in the form of about 100 theorems, making ample use of the fact that deductive independence is nothing but subcontrary opposition, and close with a remark on the fundamental difference between deductive and logical dependence—two relations the ideas of which are all too easily mixed up.——Chapters 4 and 5 deal extensively with the traditional ideas of probabilistic (in)dependence, applied to formulae rather than to events. As always, I proceed axiomatically in a step-by-step process under systematic viewpoints and obtain about 300 theorems in this way. In the formulation of the theorems, I took special care to state clearly and expressly so-called tacit assumptions, especially those concerning the probability values of the formulae said to be dependent on each other. These assumptions are usually missing in the literature, due either to economy of writing or to sloppiness of thinking. Presumably, both chapters contain little that is new, their value lying more in the systematic grouping and organic development of the theorems than in the newness of these.——In chapter 6, I extend the axiomatic theory about probabilistic (in)dependence which has been elaborated in chapter 5, to an axiomatic theory of inductive (in)dependence by requiring of the relation of inductive (in)dependence that it be probabilistic (in)dependence, but not also logical implication or logical opposition. I point out the differences between probabilistic and inductive (in)dependence by means of some 60 theorems and close my examination of inductive (in)dependence by considering its relationship to the notion of support in the philosophy of science.——Finally, in chapter 7, the last of part 1, I take the step from inductive dependence to what I call ‘purely inductive dependence’ by combining the idea of inductive dependence with that of deductive independence in a way which is suggested by writings of Popper and Miller. I arrive at two noteworthy theorems. Firstly, there is indeed no purely inductive support. But secondly, and perhaps amazingly, countersupport is purely inductive.————Whereas the probabilistic framework of part 1 of the present work is Kolmogorov probability semantics, the framework of part 2 is Popper probability semantics, which is not only worth examining as a fascinating alternative to orthodox Kolmogorov probability semantics, but also allows us to examine dependence relations more deeply, than Kolmogorov probability semantics does. Part 2 leads—again in an axiomatic step-by-step development—from the basic Popper probability semantics of L, called ‘Pb’, (chapter 8) via a probabilistic theory of logical attributes, called ‘Ps’, (chapter 9) to four axiomatic semantical theories of dependence relations between the formulae of L. First, Ps is extended to a theory, called ‘Pdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 10). Then Pdd is extended to a theory, called ‘Ppd’, of (in all) 20 relations of probabilistic (in)dependence, relativized to binary Popper probability functions defined on L (chapter 11). Ppd, in its turn, is extended to a theory, called ‘Pid’, of (in all) 10 relations of inductive dependence, again relativized to binary Popper probability functions defined on L (first part of chapter 12). Finally, Pid is extended to a theory, called ‘Ppid’, of (in all) 15 relations of purely inductive positive and negative dependence, relativized to binary Popper probability functions defined on L (second part of chapter 12).——Chapter 8, the first chapter of part 2 of the present work, is entirely preparatory. It introduces the axioms and about 180 theorems (150 of them together with their proofs) of basic Popper probability semantics in order to set this kind of semantics under way.——Then, in chapter 9, basic Popper probability semantics is extended to a probabilistic theory of logical properties of and relations between the formulae of L. Although I think that the way I did this extension is of some interest in itself, the main task of chapter 9 is again a preparatory one: to yield the indispensable lemmata (about 90 in number) for the theorems concerning probabilistic dependence relations in chapter 11 and concerning inductive dependence relations in chapter 12.——Chapter 10 brings the extension of Ps to the theory Pdd of deductive (in)dependence. Only half a dozen theorems are noted here for later use in the Pdd-extensions Ppd and Ppid. In view of the over 100 theorems already gained on this topic in the Kolmogorovian framework (cf. chapter 3), a similar extensive elaboration of Pdd would have been superfluous.——Chapter 11 is the most important one of part 2. It consists of a systematic comparison of 20 probabilistic (in)dependence concepts by means of about 230 theorems, obtained within the axiomatic theory Ppd, which is built up as an extension of Pdd. The main points of comparison were: differences in logical strength; reflexivity and symmetry; behaviour under the condition that the probability values of the formulae in question are extreme. It turned out that each of the examined concepts violates a strong and straightforward version of the intuitive requirement that probabilistic dependence should go with logical dependence. Whereas the corresponding chapter 5 in part 1 of the present work may not have led to new theorems, chapter 11 yields dozens of them in the process of comparison of concepts of dependence and independence which had—as far as I know—never before been treated in a single theoretical framework. With Popper probability semantics, this framework has become available, and here I have simply made full use of it.——In chapter 12, I extend the theory Ppd of probabilistic (in)dependence to the theories Pid and Ppid of inductive and purely inductive dependence, in a way very similar to that in which I have extended the theory Kpd2 to the theories Kid and Kpid in chapters 6 and 7. The first main result of Kpid (roughly: there is no purely inductive support) could be repeated for four of the five purely inductive positive dependence relations considered in chapter 12, whereas the second main result of Kpid (roughly: there is purely inductive countersupport ) could be repeated for each of the five examined purely inductive negative dependence relations. Chapter 12 closes with a brief recapitulation and critical discussion of the main results. (shrink)

One of the many intriguing features of the axiomatic systems of probability investigated in Popper (1959), appendices _iv, _v, is the different status of the two arguments of the probability functor with regard to the laws of replacement and commutation. The laws for the first argument, (rep1) and (comm1), follow from much simpler axioms, whilst (rep2) and (comm2) are independent of them, and have to be incorporated only when most of the important deductions have been accomplished. It is plain that, (...) in the presence of (comm1), the principle (sub), which says that terms that are intersubstitutable in the first argument are intersubstitutable also in the second argument, implies (comm2), and in Popper’s systems the converse implication obtains. It is naturally asked what is needed in an axiomatic theory of probability in order to enforce this equivalence. Leblanc (1981) offered a rather weak set of axioms, containing (comm1) and (comm2), that suffice for the derivation of (sub). In this paper Leblanc’s result is improved in a number of different ways. Three weaker systems, one of which is incomparable with the other two, are shown to admit the same implication. DOI:10.5007/1808-1711.2011v15n2p271. (shrink)

The long history of ergodic and quasi-ergodic hypotheses provides the best example of the attempt to supply non-probabilistic justifications for the use of statistical mechanics in describing mechanical systems. In this paper we reverse the terms of the problem. We aim to show that accepting a probabilistic foundation of elementary particle statistics dispenses with the need to resort to ambiguous non-probabilistic notions like that of (in)distinguishability. In the quantum case, starting from suitable probability conditions, it is possible (...) to deduce elementary particle statistics in a unified way. Following our approach Maxwell-Boltzmann statistics can also be deduced, and this deduction clarifies its status.Thus our primary aim in this paper is to give a mathematically rigorous deduction of the probability of a state with given energy for a perfect gas in statistical equilibrium; that is, a deduction of the equilibrium distribution for a perfect gas. A crucial step in this deduction is the statement of a unified statistical theory based on clearly formulated probability conditions from which the particle statistics follows. We believe that such a deduction represents an important improvement in elementary particle statistics, and a step towards a probabilistic foundation of statistical mechanics.In this Part I we first present some history: we recall some results of Boltzmann and Brillouin that go in the direction we will follow. Then we present a number of probability results we shall use in Part II. Finally, we state a notion of entropy referring to probability distributions, and give a natural solution to Gibbs' paradox. (shrink)

In this paper we show the embedding of Hybrid Probabilistic Logic Programs into the rather general framework of Residuated Logic Programs, where the main results of (definite) logic programming are validly extrapolated, namely the extension of the immediate consequences operator of van Emden and Kowalski. The importance of this result is that for the first time a framework encompassing several quite distinct logic programming semantics is described, namely Generalized Annotated Logic Programs, Fuzzy Logic Programming, Hybrid Probabilistic Logic Programs, (...) and Possibilistic Logic Programming. Moreover, the embedding provides a more general semantical structure paving the way for defining paraconsistent probabilistic reasoning with a logic programming semantics. (shrink)

For certain methodological and historical reasons, the science of probability (probabilistics) had never been constructed before as a single whole, and it has basically split into probability theory and into statistics. One of the reasons was the neglect of an extremely important methodological principle which reads: It is necessary to distinguish strictly between concrete objects and abstract objects. This principle is displayed and exemplified. Its use has made it possible to discover the basic phenomenon of probalilistics and to construct the (...) science, whose outlines are given. The application of probabilistics to physics gives rise to probabilistic physics, whose particular domains are, among others, both classical statistical physics and quantum physics. The actual meaning of quantum physics becomes quite clear and no artificial interpretation of it proves to be necessary. (shrink)

A coherence-based probability semantics for categorical syllogisms of Figure I, which have transitive structures, has been proposed recently (Gilio, Pfeifer, & Sanfilippo [15]). We extend this work by studying Figure II under coherence. Camestres is an example of a Figure II syllogism: from Every P is M and No S is M infer No S is P. We interpret these sentences by suitable conditional probability assessments. Since the probabilistic inference of ~????|???? from the premise set {????|????, ~????|????} is not (...) informative, we add ????(????|(????∨????))>0 as a probabilistic constraint (i.e., an “existential import assumption”) to obtain probabilistic informativeness. We show how to propagate the assigned (precise or interval-valued) probabilities to the sequence of conditional events (????|????,~????|????,????|(????∨????)) to the conclusion ~????|???? . Thereby, we give a probabilistic meaning to the other syllogisms of Figure II. Moreover, our semantics also allows for generalizing the traditional syllogisms to new ones involving generalized quantifiers (like Most S are P) and syllogisms in terms of defaults and negated defaults. (shrink)

In this paper we show the embedding of Hybrid Probabilistic Logic Programs into the rather general framework of Residuated Logic Programs, where the main results of (definite) logic programming are validly extrapolated, namely the extension of the immediate consequences operator of van Emden and Kowalski. The importance of this result is that for the first time a framework encompassing several quite distinct logic programming semantics is described, namely Generalized Annotated Logic Programs, Fuzzy Logic Programming, Hybrid Probabilistic Logic Programs, (...) and Possibilistic Logic Programming. Moreover, the embedding provides a more general semantical structure paving the way for defining paraconsistent probabilistic reasoning with a logic programming semantics. (shrink)

The goal of standard semantics is to provide truth conditions for the sentences of a given language. Probabilistic Semantics does not share this aim; it might be said instead, if rather cryptically, that Probabilistic Semantics aims to provide belief conditions.The central and guiding idea of Probabilistic Semantics is that each rational individual has ‘within’ him or her a personal subjective probability function. The output of the function when given a certain sentence as input represents the degree of (...) likelihood which the individual would assign to that sentence. One can characterize these functions via a set of axioms, and in the terms of this defined structure develop probabilistic analogues of all important semantical notions. Then, dealing with ‘being given probability 1’ instead of ‘truth,’ one can proceed to give a completely adequate semantics for the particular language under consideration. The axioms delimiting the class of probability functions are, in fact, chosen with this goal and language in mind. (shrink)

It is argued in this paper that although much attention has been paid to causal chains and common causes within the literature on probabilistic causality, a primary virtue of that approach is its ability to deal with cases of multiple causation. In doing so some ways are indicated in which contemporary sine qua non analyses of causation are too narrow (and ways in which probabilistic causality is not) and an argument by Reichenbach designed to provide a basis for (...) the asymmetry of causation is refined. The importance of referring causal claims to an abstract model is also emphasized. (shrink)

To understand something involves some sort of commitment to a set of propositions comprising an account of the understood phenomenon. Some take this commitment to be a species of belief; others, such as Elgin and I, take it to be a kind of cognitive policy. This paper takes a step back from debates about the nature of understanding and asks when this commitment involved in understanding is epistemically appropriate, or ‘acceptable’ in Elgin’s terminology. In particular, appealing to lessons from the (...) lottery and preface paradoxes, it is argued that this type of commitment is sometimes acceptable even when it would be rational to assign arbitrarily low probabilities to the relevant propositions. This strongly suggests that the relevant type of commitment is sometimes acceptable in the absence of epistemic justification for belief, which in turn implies that understanding does not require justification in the traditional sense. The paper goes on to develop a new probabilistic model of acceptability, based on the idea that the maximally informative accounts of the understood phenomenon should be optimally probable. Interestingly, this probabilistic model ends up being similar in important ways to Elgin’s proposal to analyze the acceptability of such commitments in terms of ‘reflective equilibrium’. (shrink)

The elements of structural models used in the social sciences are built up from four fundamental assumptions. It is then shown how the central idea of qualitative probabilistic causality follows as a special case of this covariational account. The relationships of both instrumentalism and common cause arguments for scientific realism to these structures is demonstrated. It is concluded that a predictivist argument against a thoroughgoing instrumentalism can be given, and hence why the difference between experimental and non-experimental contexts is (...) important to arguments for scientific realism. (shrink)

I develop a probabilistic account of coherence, and argue that at least in certain respects it is preferable to (at least some of) the main extant probabilistic accounts of coherence: (i) Igor Douven and Wouter Meijs’s account, (ii) Branden Fitelson’s account, (iii) Erik Olsson’s account, and (iv) Tomoji Shogenji’s account. Further, I relate the account to an important, but little discussed, problem for standard varieties of coherentism, viz., the “Problem of Justified Inconsistent Beliefs.”.

I advance a new theory of causal relevance, according to which causal claims convey information about conditional probability functions. This theory is motivated by the problem of disjunctive factors, which haunts existing probabilistic theories of causation. After some introductory remarks, I present in Section 3 a sketch of Eells's (1991) probabilistic theory of causation, which provides the framework for much of the discussion. Section 4 explains how the problem of disjunctive factors arises within this framework. After rejecting three (...) proposed solutions, I offer in Section 6 a new approach to causation that avoids the problem. Decision-theoretic considerations also support the new approach. Section 8 develops the consequences of the new theory for causal explanation. The resulting theory of causal explanation incorporates the new insights while respecting important work on scientific explanation by Salmon (1971), Railton (1981), and Humphreys (1989). My conclusions are enumerated in Section 9. (shrink)

Sarah Moss’ thesis that we have probabilistic knowledge is from some perspectives unsurprising and from other perspectives hard to make sense of. The thesis is potentially transformative, but not yet elaborated in sufficient detail for epistemologists. This paper interprets Mossean probabilistic knowledge in a suitably-modified Kripke framework, thus filling in key details. It argues that probabilistic knowledge looks natural and plausible when so interpreted, and shows how the most pressing challenges to the thesis can be overcome. Most (...) importantly, probabilistic knowledge can satisfy factivity in the framework, though we are not forced to accept a specific account of probabilistic “facts”. The framework also reflects Moss’ claim that old-fashioned propositional knowledge is just a limiting case of probabilistic knowledge, and all knowledge is fundamentally probabilistic. Finally, Moss endorses a failure of contraposition: for example, p implies probably p, but not probably p does not imply not p. The framework makes clear the sense in which the valid inferences regarding probably p are as Moss claims. (shrink)

One of the many intriguing features of the axiomatic systems of probability investigated in Popper (1959), appendices _iv, _v, is the different status of the two arguments of the probability functor with regard to the laws of replacement and commutation. The laws for the first argument, (rep1) and (comm1), follow from much simpler axioms, whilst (rep2) and (comm2) are independent of them, and have to be incorporated only when most of the important deductions have been accomplished. It is plain that, (...) in the presence of (comm1), the principle (sub), which says that terms that are intersubstitutable in the first argument are intersubstitutable also in the second argument, implies (comm2), and in Popper’s systems the converse implication obtains. It is naturally asked what is needed in an axiomatic theory of probability in order to enforce this equivalence. Leblanc (1981) offered a rather weak set of axioms, containing (comm1) and (comm2), that suffice for the derivation of (sub). In this paper Leblanc’s result is improved in a number of different ways. Three weaker systems, one of which is incomparable with the other two, are shown to admit the same implication. (shrink)

This paper studies Aumann’s agreeing to disagree theorem from the perspective of dynamic epistemic logic. This was first done by Dégremont and Roy (J Phil Log 41:735–764, 2012) in the qualitative framework of plausibility models. The current paper uses a probabilistic framework, and thus stays closer to Aumann’s original formulation. The paper first introduces enriched probabilistic Kripke frames and models, and various ways of updating them. This framework is then used to prove several agreement theorems, which are natural (...) formalizations of Aumann’s original result. Furthermore, a sound and complete axiomatization of a dynamic agreement logic is provided, in which one of these agreement theorems can be derived syntactically. These technical results are used to show the importance of explicitly representing the dynamics behind the agreement theorem, and lead to a clarification of some conceptual issues surrounding the agreement theorem, in particular concerning the role of common knowledge. The formalization of the agreement theorem thus constitutes a concrete example of the so-called dynamic turn in logic. (shrink)

Key Terms in Logic offers the ideal introduction to this core area in the study of philosophy, providing detailed summaries of the important concepts in the study of logic and the application of logic to the rest of philosophy. A brief introduction provides context and background, while the following chapters offer detailed definitions of key terms and concepts, introductions to the work of key thinkers and lists of key texts. Designed specifically to meet the needs of students and assuming no (...) prior knowledge of the subject, this is the ideal reference tool for those coming to Logic for the first time. (shrink)

Key Terms in Logic offers the ideal introduction to this core area in the study of philosophy, providing detailed summaries of the important concepts in the study of logic and the application of logic to the rest of philosophy. A brief introduction provides context and background, while the following chapters offer detailed definitions of key terms and concepts, introductions to the work of key thinkers and lists of key texts. Designed specifically to meet the needs of students and assuming no (...) prior knowledge of the subject, this is the ideal reference tool for those coming to Logic for the first time. (shrink)

Key Terms in Logic offers the ideal introduction to this core area in the study of philosophy, providing detailed summaries of the important concepts in the study of logic and the application of logic to the rest of philosophy. A brief introduction provides context and background, while the following chapters offer detailed definitions of key terms and concepts, introductions to the work of key thinkers and lists of key texts. Designed specifically to meet the needs of students and assuming no (...) prior knowledge of the subject, this is the ideal reference tool for those coming to Logic for the first time. (shrink)

Key Terms in Logic offers the ideal introduction to this core area in the study of philosophy, providing detailed summaries of the important concepts in the study of logic and the application of logic to the rest of philosophy. A brief introduction provides context and background, while the following chapters offer detailed definitions of key terms and concepts, introductions to the work of key thinkers and lists of key texts. Designed specifically to meet the needs of students and assuming no (...) prior knowledge of the subject, this is the ideal reference tool for those coming to Logic for the first time. (shrink)

Probabilistic support is not transitive. There are cases in which x probabilistically supports y , i.e., Pr( y | x ) > Pr( y ), y , in turn, probabilistically supports z , and yet it is not the case that x probabilistically supports z . Tomoji Shogenji, though, establishes a condition for transitivity in probabilistic support, that is, a condition such that, for any x , y , and z , if Pr( y | x ) > (...) Pr( y ), Pr( z | y ) > Pr( z ), and the condition in question is satisfied, then Pr( z | x ) > Pr( z ). I argue for a second and weaker condition for transitivity in probabilistic support. This condition, or the principle involving it, makes it easier (than does the condition Shogenji provides) to establish claims of probabilistic support, and has the potential to play an important role in at least some areas of philosophy. (shrink)

Probability theory, epistemically interpreted, provides an excellent, if not the best available account of inductive reasoning. This is so because there are general and definite rules for the change of subjective probabilities through information or experience; induction and belief change are one and same topic, after all. The most basic of these rules is simply to conditionalize with respect to the information received; and there are similar and more general rules. 1 Hence, a fundamental reason for the epistemological success of (...) probability theory is that there at all exists a well-behaved concept of conditional probability. Still, people have, and have reasons for, various concerns over probability theory. One of these is my starting point: Intuitively, we have the notion of plain belief; we believe propositions2 to be true (or to be false or neither). Probability theory, however, offers no formal counterpart to this notion. Believing A is not the same as having probability 1 for A, because probability 1 is incorrigible3; but plain belief is clearly corrigible. And believing A is not the same as giving A a probability larger than some 1 - c, because believing A and believing B is usually taken to be equivalent to believing A & B.4 Thus, it seems that the formal representation of plain belief has to take a non-probabilistic route. Indeed, representing plain belief seems easy enough: simply represent an epistemic state by the set of all propositions believed true in it or, since I make the common assumption that plain belief is deductively closed, by the conjunction of all propositions believed true in it. But this does not yet provide a theory of induction, i.e. an answer to the question how epistemic states so represented are changed tbrough information or experience. There is a convincing partial answer: if the new information is compatible with the old epistemic state, then the new epistemic state is simply represented by the conjunction of the new information and the old beliefs. This answer is partial because it does not cover the quite common case where the new information is incompatible with the old beliefs. It is, however, important to complete the answer and to cover this case, too; otherwise, we would not represent plain belief as conigible. The crucial problem is that there is no good completion. When epistemic states are represented simply by the conjunction of all propositions believed true in it, the answer cannot be completed; and though there is a lot of fruitful work, no other representation of epistemic states has been proposed, as far as I know, which provides a complete solution to this problem. In this paper, I want to suggest such a solution. In [4], I have more fully argued that this is the only solution, if certain plausible desiderata are to be satisfied. Here, in section 2, I will be content with formally defining and intuitively explaining my proposal. I will compare my proposal with probability theory in section 3. It will turn out that the theory I am proposing is structurally homomorphic to probability theory in important respects and that it is thus equally easily implementable, but moreover computationally simpler. Section 4 contains a very brief comparison with various kinds of logics, in particular conditional logic, with Shackle's functions of potential surprise and related theories, and with the Dempster - Shafer theory of belief functions. (shrink)

Two distinct issues are sometimes confused in the base rate literature: Why do people make logical mistakes in the assessment of probabilities? and why do subjects not use base rates the way experimenters do? The latter problem may often reflect differences in an implicit reference class rather than a disinclination to update a base rate by Bayes' theorem. Also important are considerations concerning the interaction of several potentially relevant base rates.

Several philosophers have used the framework of means/ends reasoning to explain the methodological choices made by scientists and mathematicians (see, e.g., Goldman 1999, Levi 1962, Maddy 1997). In particular, they have tried to identify the epistemic objectives of scientists and mathematicians that will explain these choices. In this paper, the framework of means/ends reasoning is used to study an important methodological choice made by mathematicians. Namely, mathematicians will only use deductive proofs to establish the truth of mathematical claims. In this (...) paper, I argue that none of the epistemic objectives of mathematicians that are currently on the table provide a satisfactory explanation of this rejection of probabilistic proofs. (shrink)

McTaggart distinguished two conceptions of time: the A-series, according to which events are either past, present or future; and the B-series, according to which events are merely earlier or later than other events. Elsewhere, I have argued that these two views, ostensibly about the nature of time, need to be reinterpreted as two views about the nature of the universe. According to the so-called A-theory, the universe is three dimensional, with a past and future; according to the B-theory, the universe (...) is four dimensional. Given special relativity (SR), we are obliged, it seems, to accept (a modified version of) the B-series, four dimensional view, and reject the A-series, three dimensional view, because SR denies that there is a privileged, instantaneous cosmic "now" which seems to be required by the A-theory. Whether this is correct or not, it is important to remember that the fundamental problem, here, is not "What does SR imply?", but rather "What is the best guess about the ultimate nature of the universe in the light of current theoretical knowledge in physics?". In order to know how to answer this question, we need to have some inkling as to how the correct theory of quantum gravity incorporates quantum theory, probability and time. This is, at present, an entirely open question. String theory, or M-theory, seems to evade the issue, and other approaches to quantum gravity seem equally evasive. However, if probabilism is a fundamental feature of ultimate physical reality, then it may well be that the A-theory, or rather a closely related doctrine I call “objectism”, is built into the ultimate constitution of things. (shrink)

Inductive probabilistic reasoning is understood as the application of inference patterns that use statistical background information to assign (subjective) probabilities to single events. The simplest such inference pattern is direct inference: from “70% of As are Bs” and “a is an A” infer that a is a B with probability 0.7. Direct inference is generalized by Jeffrey’s rule and the principle of cross-entropy minimization. To adequately formalize inductive probabilistic reasoning is an interesting topic for artificial intelligence, as an (...) autonomous system acting in a complex environment may have to base its actions on a probabilistic model of its environment, and the probabilities needed to form this model can often be obtained by combining statistical background information with particular observations made, i.e., by inductive probabilistic reasoning. In this paper a formal framework for inductive probabilistic reasoning is developed: syntactically it consists of an extension of the language of first-order predicate logic that allows to express statements about both statistical and subjective probabilities. Semantics for this representation language are developed that give rise to two distinct entailment relations: a relation ⊨ that models strict, probabilistically valid, inferences, and a relation that models inductive probabilistic inferences. The inductive entailment relation is obtained by implementing cross-entropy minimization in a preferred model semantics. A main objective of our approach is to ensure that for both entailment relations complete proof systems exist. This is achieved by allowing probability distributions in our semantic models that use non-standard probability values. A number of results are presented that show that in several important aspects the resulting logic behaves just like a logic based on real-valued probabilities alone. (shrink)

Some propositions are structurally unknowable for certain agents. Let me call them ‘Moorean propositions’. The structural unknowability of Moorean propositions is normally taken to pave the way towards proving a familiar paradox from epistemic logic—the so-called ‘Knowability Paradox’, or ‘Fitch’s Paradox’—which purports to show that if all truths are knowable, then all truths are in fact known. The present paper explores how to translate Moorean statements into a probabilistic language. A successful translation should enable us to derive a version (...) of Fitch’s Paradox in a probabilistic setting. I offer a suitable schematic form for probabilistic Moorean propositions, as well as a concomitant proof of a probabilistic Knowability Paradox. Moreover, I argue that traditional candidates to play the role of probabilistic Moorean propositions will not do. In particular, we can show that violations of the so-called ‘Reflection Principle’ in probability need not yield structurally unknowable propositions. Among other things, this should lead us to question whether violating the Reflection Principle actually amounts to a clear case of epistemic irrationality, as it is often assumed. This result challenges the importance of the principle as a tool to assess both synchronic and diachronic rationality—a topic which is largely independent of Fitch’s Paradox—from a somewhat unexpected source. (shrink)

This paper calls for a re-appraisal of McGee's analysis of the semantics, logic and probabilities of indicative conditionals presented in his 1989 paper Conditional probabilities and compounds of conditionals. The probabilistic measures introduced by McGee are given a new axiomatisation built on the principle that the antecedent of a conditional is probabilistically independent of the conditional and a more transparent method of constructing such measures is provided. McGee's Dutch book argument is restructured to more clearly reveal that it introduces (...) a novel contribution to the epistemology of semantic indeterminacy, and shows that its more controversial implications are unavoidable if we want to maintain the Ramsey Test along with the standard laws of probability. Importantly, it is shown that the counterexamples that have been levelled at McGee's analysis|generating a rather wide consensus that it yields `unintuitive' or `wrong' probabilities for compounds |fail to strike at their intended target; for to honour the intuitions of the counterexamples one must either give up the Ramsey Test or the standard laws of probability. It will be argued that we need to give up neither if we take the counterexamples as further evidence that the indicative conditional sometimes allows for a non-epistemic `causal' interpretation alongside its usual epistemic interpretation. (shrink)

Following some ideas of Roberto Magari, we propose trial and error probabilistic functions, i.e. probability measures on the sentences of arithmetic that evolve in time by trial and error. The set ℐ of the sentences that get limit probability 1 is a Π3—theory, in fact ℐ can be a Π3—complete set. We prove incompleteness results for this setting, by showing for instance that for every k > 0 there are true Π3—sentences that get limit probability less than 1/2k. No (...) set ℐ as above can contain the set of all true Π3—sentences, although we exhibit some ℐ containing all the true Σ2—sentences. We also consider an approach based on the notions of inner probability and outer probability, and we compare this approach with the one based on trial and error probabilistic functions. Although the two approaches are shown to be different, we single out an important case in which they are equivalent. (shrink)

Coherence is a property of propositions hanging together or dovetailing with each other. About two decades ago, formal epistemologists started to engage in the project of explicating the seemingly elusive concept of coherence by means of probability theory. Since then, a plethora of coherence measures have been discussed in the literature. In this paper, we propose a general framework for coherence measures that encompasses the different frameworks of deviation measures, overlap measures and mutual support measures of coherence. Above that we (...) show that some of the new measures that can be obtained outperform existing coherence measures in important respects. (shrink)

One of the main assumptions of mathematical tools in science is represented by the idea of measurability and additivity of reality. For discovering the physical universe additive measures such as mass, force, energy, temperature, etc. are used. Economics and conventional business intelligence try to continue this empiricist tradition and in statistical and econometric tools they appeal only to the measurable aspects of reality. However, a lot of important variables of economic systems cannot be observable and additive in principle. These variables (...) can be called symbolic values or symbolic meanings and studied within symbolic interactionism, the theory developed since George Herbert Mead and Herbert Blumer. In statistical and econometric tools of business intelligence we accept only phenomena with causal connections measured by additive measures. In the paper we show that in the social world we deal with symbolic interactions which can be studied by non-additive labels. For accepting the variety of such phenomena we should avoid additivity of basic labels and construct a new probabilistic method in business intelligence based on non-Archimedean probabilities. (shrink)

Monogenesis of language is widely accepted, but the conventional argument seems to be mistaken; a simple probabilistic model shows that polygenesis is likely. Other prehistoric inventions are discussed, as are problems in tracing linguistic lineages. Language is a system of representations; within such a system, words can evoke complex and systematic responses. Along with its social functions, language is important to humans as a mental instrument. Indeed, the invention of language,that is the accumulation of symbols to represent emotions, objects, (...) and acts may be the most important event in human evolution, because so many developments follow from it. For example, Edward Sapir speculated that some embryonic form of language must have been available to early man to help him fashion tools from stone (Sapir,1921). Sophisticated biface stone tools date to early Homo erectus some 1.5 million years ago, suggesting a similar age for language. This paper considers whether the invention of language occurred at only one pre-historic site or at several sites. In other words, did language emerge by monogenesis or polygenesis? Early thinkers believed in monogenesis, against a background of divine creation. Perhaps the best known account is the biblical story of Adam giving names to plants and animals in the Garden of Eden. Similar legends are found among many peoples. Modern linguists too assume monogenesis, but on probabilistic grounds (see, for instance, Southworth and Daswani, 1974, p.314). The argument seems to be that the invention of language is an extremely unlikely event, because symbolization involves abstraction and requires synchronized insight by several individuals; therefore, the probability of occurrence at more than one site must be vanishingly small. We have found no explicit quantitative treatment of this question in the literature, but the underlying logic has to be the multiplication of probabilities. If p is small at one site,then p.p for two sites is smaller still, and so on. This reasoning is false, as we show here. The fallacy lies in the focus on two particular sites rather than consideration of all pairs of sites. (shrink)

This volume identifies the different ways in which one event can compel the occurrence of another event and on this basis identifies important facts about the nature of probability and probabilistic inference.

We propose a new approach for tracing value change. Value change may lead to a mismatch between current value priorities in society and the values for which technologies were designed in the past, such as energy technologies based on fossil fuels, which were developed when sustainability was not considered a very important value. Better anticipating value change is essential to avoid a lack of social acceptance and moral acceptability of technologies. While value change can be studied historically and qualitatively, we (...) propose a more quantitative approach that uses large text corpora. It uses probabilistic topic models, which allow us to trace values that are latent. We demonstrate the approach for five types of value change in technology. Our approach is useful for testing hypotheses about value change, such as verifying whether value change has occurred and identifying patterns of value change. The approach can be used to trace value change for various technologies and text corpora, including scientific articles, newspaper articles, and policy documents. (shrink)

Human beings crave explanations of all sorts of things. If “probabilityis our very guide of life,” then probability must play a crucial role in explanation. There are, of course, many types of explanations, and scientific explanations are no doubt in the minority; nevertheless, they are sometimes enormously important. Carl G. Hempel and Paul Oppenheim’s 1948 classic, “Studies in the Logic of Explanation,” characterized one form of deductive explanation with considerable precision, as well as another, which they dealt with much less (...) formally. They also explicitly acknowledged the need for statistical laws and statistical forms of scientific explanation, a topic lying beyond the scope of that essay. (shrink)

One of the main goals of Bayesian epistemology is to justify the rational norms credence functions ought to obey. Accuracy arguments attempt to justify these norms from the assumption that the source of value for credences relevant to their epistemic status is their accuracy. This assumption and some standard decision-theoretic principles are used to argue for norms like Probabilism, the thesis that an agent’s credence function is rational only if it obeys the probability axioms. We introduce an example that shows (...) that the accuracy arguments for Probabilism given by Joyce and Pettigrew fail, and that Probabilism in fact turns out to be false given Pettigrew’s way of conceiving of the goal of having accurate credences. Finally, we use our discussion of Pettigrew’s framework to draw an important general lesson about normative theorizing that relies on the positing of ideal agents. (shrink)