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)

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)

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

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

PROBABILISTIC APPROACH TO EPISTEMIC MODALS IN THE FRAMEWORK OF DYNAMIC SEMANTICS In dynamic semantics meaning of a statement is not equated with its truth conditions but with its context change potential. It has also been claimed that dynamic framework can automatically account for certain paradoxes that involve epistemic modals, such as the following one: it seems odd and incoherent to claim: (1) “It is raining and it might not rain”, whereas claiming (2) “It might not rain and it is (...) raining” does not seem equally odd (Yalcin, 2007). Nevertheless, it seems that it cannot capture the fact that statement (2) seems odd as well, even though not as odd as the statement (1) (Gauker, 2007). I will argue that certain probabilistic extensions to the dynamic model can account for this subtlety of our linguistic intuitions and represent if not an improved than at least an alternative framework for capturing the way contexts are updated and beliefs revised with uncertain information. (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)

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

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)

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

According to Bayesian epistemology, rational learning from experience is consistent learning, that is learning should incorporate new information consistently into one's old system of beliefs. Simon M. Huttegger argues that this core idea can be transferred to situations where the learner's informational inputs are much more limited than Bayesianism assumes, thereby significantly expanding the reach of a Bayesian type of epistemology. What results from this is a unified account of probabilistic learning in the tradition of Richard Jeffrey's 'radical probabilism'. (...) Along the way, Huttegger addresses a number of debates in epistemology and the philosophy of science, including the status of prior probabilities, whether Bayes' rule is the only legitimate form of learning from experience, and whether rational agents can have sustained disagreements. His book will be of interest to students and scholars of epistemology, of game and decision theory, and of cognitive, economic, and computer sciences. (shrink)

While probabilistic logics in principle might be applied to solve a range of problems, in practice they are rarely applied --- perhaps because they seem disparate, complicated, and computationally intractable. This programmatic book argues that several approaches to probabilistic logic fit into a simple unifying framework in which logically complex evidence is used to associate probability intervals or probabilities with sentences. Specifically, Part I shows that there is a natural way to present a question posed in probabilistic (...) logic, and that various inferential procedures provide semantics for that question, while Part II shows that there is the potential to develop computationally feasible methods to mesh with this framework. The book is intended for researchers in philosophy, logic, computer science and statistics. A familiarity with mathematical concepts and notation is presumed, but no advanced knowledge of logic or probability theory is required. (shrink)

We study a propositional probabilistic temporal epistemic logic $\textbf {PTEL}$ with both future and past temporal operators, with non-rigid set of agents and the operators for agents’ knowledge and for common knowledge and with probabilities defined on the sets of runs and on the sets of possible worlds. A semantics is given by a class ${\scriptsize{\rm Mod}}$ of Kripke-like models with possible worlds. We prove decidability of $\textbf {PTEL}$ by showing that checking satisfiability of a formula in ${\scriptsize{\rm Mod}}$ (...) is equivalent to checking its satisfiability in a finite set of finitely representable structures. The same procedure can be applied to the class of all synchronous ${\scriptsize{\rm Mod}}$-models. We give an upper complexity bound for the satisfiability problem for ${\scriptsize{\rm Mod}}$. (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)

A probabilistic propositional logic, endowed with a constructor for asserting compatibility of diagonalisable and bounded observables, is presented and illustrated for reasoning about the random results of projective measurements made on a given quantum state. Simultaneous measurements are assumed to imply that the underlying observables are compatible. A sound and weakly complete axiomatisation is provided relying on the decidable first-order theory of real closed ordered fields. The proposed logic is proved to be a conservative extension of classical propositional logic.

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)

This chapter provides an overview of a range of probabilistic theories of causality, including those of Reichenbach, Good and Suppes, and the contemporary causal net approach. It discusses two key problems for probabilistic accounts: counterexamples to these theories and their failure to account for the relationship between causality and mechanisms. It is argued that to overcome the problems, an epistemic theory of causality is required.

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)

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)

We investigate an approach for drawing logical inference from inconsistent premisses. The main idea in this approach is that the inconsistencies in the premisses should be interpreted as uncertainty of the information. We propose a mechanism, based on Kinght’s [14] study of inconsistency, for revising an inconsistent set of premisses to a minimally uncertain, probabilistically consistent one. We will then generalise the probabilistic entailment relation introduced in [15] for propositional languages to the first order case to draw logical inference (...) from a probabilistic set of premisses. We will show how this combination can allow us to limit the effect of uncertainty introduced by inconsistent premisses to only the reasoning on the part of the premise set that is relevant to the inconsistency. (shrink)

In this paper I provide a probabilistic account of factual knowledge,[1] based on the notion of chance.[2] This account has some affinity with my chance account of token causation,[3] but it neither relies on it nor presupposes it. Here I concentrate on the core cases of perceptual knowledge and of knowledge by memory (based on perception). The analysis of knowledge presented below is externalist; but pursuing such an analysis need not detract from the significance of attempts to flesh out (...) justificational analyses knowledge; indeed, I have pursued such an analysis in great detail myself. (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)

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

The paper starts with the distinction between conjunction-of-parts accounts and disjunction-of-possibilities accounts to truthlikeness. In Sect. 3, three distinctions between kinds of truthlikeness measures are introduced: comparative versus numeric t-measures, t-measures for qualitative versus quantitative theories, and t-measures for deterministic versus probabilistic truth. These three kinds of truthlikeness are explicated and developed within a version of conjunctive part accounts based on content elements. The focus lies on measures of probabilistic truthlikeness, that are divided into t-measures for statistical probabilities (...) and single case probabilities. The logical notion of probabilistic truthlikeness can be treated as a subcase of deterministic truthlikeness for quantitative theories. In contrast, the epistemic notion of probabilistic truthlikeness creates genuinely new problems, especially for hypotheses about single case probabilities that are evaluated not by comparison to observed frequencies, but by comparison to the truth values of single event statements. By the method of meta-induction, competing theories about single case probabilities can be aggregated into a combined theory with optimal predictive success and epistemic truthlikeness. (shrink)

A probabilistic and counterfactual theory of causality is developed within the framework of branching time. The theory combines ideas developed by James Fetzer, Donald Nute, Patrick Suppes, Ming Xu, John Pollock, David Lewis and Mellor among others.

We present new probabilistic generalizations of Pearl’s entailment in System Z and Lehmann’s lexicographic entailment, called Zλ- and lexλ-entailment, which are parameterized through a value λ ∈ [0,1] that describes the strength of the inheritance of purely probabilistic knowledge. In the special cases of λ = 0 and λ = 1, the notions of Zλ- and lexλ-entailment coincide with probabilistic generalizations of Pearl’s entailment in System Z and Lehmann’s lexicographic entailment that have been recently introduced by the (...) author. We show that the notions of Zλ- and lexλ-entailment have similar properties as their classical counterparts. In particular, they both satisfy the rationality postulates of System P and the property of Rational Monotonicity. Moreover, Zλ-entailment is weaker than lexλ-entailment, and both Zλ- and lexλ-entailment are proper generalizations of their classical counterparts. (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.

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

Journal of Political Philosophy, EarlyView.

In the two-envelope problem, a reasoner is offered two envelopes, one containing exactly twice the money in the other. After observing the amount in one envelope, it can be traded for the unseen contents of the other. It appears that it should not matter whether the envelope is traded, but recent mathematical analyses have shown that gains could be made if trading was a probabilistic function of amount observed. As a problem with a purely probabilistic solution, it provides (...) a potentially interesting way to test people's consistency with probabilistic models. Three experiments did this by varying the size of both the observed and maximum amounts, and their possible distribution. The results showed that trading decisions were affected by where the observed amount in the opened envelope fell in the distribution, though its size did not always do so. This suggests that participants’ trade decisions could be affected by the perceived probabilities of different observed amounts, which is consistent with the pro.. (shrink)

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

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

We 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)

A recent development in the philosophy of religion has been the attempt to justify belief in God using Bayesian confirmation theory. My dissertation critically discusses two prominent spokesmen for this approach--Richard Swinburne and J. L. Mackie. Using probabilistic confirmation theory, these philosophers come to wildly divergent conclusions with respect to the hypothesis of theism; Swinburne contends that the evidence raises the overall probability of the hypothesis of theism, whereas Mackie argues that the evidence disconfirms the existence of God. After (...) a careful analysis of the individual authors, this dissertation critically examines the assumptions of the project. The authors consider arguments for the existence of God separately--the cosmological argument, the argument from design, apparent miracles, the problem of evil, and arguments from religious experience--and then conjoin them to assess the cumulative effect of the arguments. The assumptions are that the probability calculus may be interpreted for a successful inductive argument for or against the existence of God, that inference to best explanation is applicable to the justification of religious belief, that the justification of belief in God is analogous to the justification of a scientific theory, and that a classical foundationalist conception of rationality is correct. It is the contention of this dissertation that all of these assumptions are incorrect. All of the major interpretations of the probability calculus are examined and it is argued that there are either no interpretations for the probability assignments or no interpretations which will advance an argument for or against the existence of God. It is also argued that the usual methods for interpreting the explanatory power of theism will not determine any non-zero probabilities; however, density measuring will provide a non-zero interpretation. In the final chapter it is argued that a subjective Bayesian conception of rationality is neither a necessary nor a sufficient condition of rationality and that classical foundationalism is self-referentially inconsistent. An alternative approach to the rationality of religious belief is offered that proceeds along Reidian and Plantingan lines, belief in God is properly basic. (shrink)

In this paper, we present a probabilistic-based method to predict malaria disease at an early stage. Malaria is a very dangerous disease that creates a lot of health problems. Therefore, there is a need for a system that helps us to recognize this disease at early stages through the visual symptoms and from the environmental data. In this paper, we proposed a Bayesian network model to predict the occurrences of malaria disease. The proposed BN model is built on different (...) attributes of the patient’s symptoms and environmental data which are divided into training and testing parts. Our proposed BN model when evaluated on the collected dataset found promising results with an accuracy of 81%. One the other hand, F1 score is also a good evaluation of these probabilistic models because there is a huge variation in class data. The complexity of these models is very high due to the increase of parent nodes in the given influence diagram, and the conditional probability table also becomes more complex. (shrink)

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)

It is shown that the probabilistic theories of coherence proposed up to now produce a number of counter-intuitive results. The last section provides some reasons for believing that no probabilistic measure will ever be able to adequately capture coherence. First, there can be no function whose arguments are nothing but tuples of probabilities, and which assigns different values to pairs of propositions {A, B} and {A, C} if A implies both B and C, or their negations, and if (...) P(B)=P(C). But such sets may indeed differ in their degree of coherence. Second, coherence is sensitive to explanatory relations between the propositions in question. Explanation, however, can hardly be captured solely in terms of probability. (shrink)

In previous publications on probability, I have followed I.J. Good in arguing that probability must be defined subjectively if we accept that the world is causally deterministic. In this article I go significantly beyond this position, arguing that we are forced to accept a subjective definition of probability if we use any probabilistic methods at all. In other words, all probabilistic methods tacitly assume a subjective definition of probability.

When we perceive the external world, our brain has to deal with the incompleteness and uncertainty associated with sensory inputs, memory and prior knowledge. In theoretical neuroscience probabilistic approaches have received a growing interest recently, as they account for the ability to reason with incomplete knowledge and to efficiently describe perceptive and behavioral tasks. How can the probability distributions that need to be estimated in these models be represented and processed in the brain, in particular at the single cell (...) level? We consider the basic function carried out by photoreceptor cells which consists in detecting the presence or absence of light. We give a system-level understanding of the process of phototransduction based on a bayesian formalism: we show that the process of phototransduction is equivalent to a temporal probabilistic inference in a Hidden Markov Model (HMM), for estimating the presence or absence of light. Thus, the biochemical mechanisms of phototransduction underlie the estimation of the current state probability distribution of the presence of light. A classical descriptive model describes the interactions between the different molecular messengers, ions, enzymes and channel proteins occurring within the photoreceptor by a set of nonlinear coupled differential equations. In contrast, the probabilistic HMM model is described by a discrete recurrence equation. It appears that the binary HMM has a general solution in the case of constant input. This allows a detailed analysis of the dynamics of the system. The biochemical system and the HMM behave similarly under steady-state conditions. Consequently a formal equivalence can be found between the biochemical system and the HMM. Numerical simulations further extend the results to the dynamic case and to noisy input. All in all, we have derived a probabilistic model equivalent to a classical descriptive model of phototransduction, which has the additional advantage of assigning a function to phototransduction. The example of phototransduction shows how simple biochemical interactions underlie simple probabilistic inferences. (shrink)

In this paper, it is shown that an event E can be the cause of an event E* even if there is a less than 100% likelihood that, given an arbitrary E-similar event, an E*-similar event will ensue.

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)

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)

This Article explores the costs and benefits of one subset of continuous and discontinuous rules. These expressions are shown to be distinct from the familiar dichotomy expressed as standards versus rules, but they share the difficulty of dividing the world of law in two. Still, regulatory approaches that focus on discontinuities can often be made more continuous, and vice versa. A speed limit is discontinuous in the sense that one drives above or below (or within) the announced limit. But it (...) is often made more continuous—even with more discontinuities— as when the stated limit is different for various kinds of vehicles. This Article works around these definitional problems to show that law often discourages useful disclosures by encouraging parties with information to offer continuous information in order to avoid after-the-fact lawsuits when specific disclosures prove to have inaccuracies. For example, it is common to hear or be warned that a medical procedure poses the risk of death, when a better-informed doctor or hospital could have given the precise percentages attached to various outcomes. Similarly, a corporation is on safe ground when it follows “generally accepted accounting principles,” when investors would have learned more from information about good and bad outcomes put in probabilistic terms. The Article works toward the suggestion that law might create a safe harbor in which probabilistic disclosures are protected when they are, or are certified to be, more useful than the ready alternative of fairly general disclosures. (shrink)

Participants were asked to draw inferences about correlation from single x,y observations. In Experiment 1 statistically sophisticated participants were given the univariate characteristics of distributions of x and y and asked to infer whether a single x, y observation came from a correlated or an uncorrelated population. In Experiment 2, students with a variety of statistical backgrounds assigned posterior probabilities to five possible populations based on single x, y observations, again given knowledge of the univariate statistics. In Experiment 3, statistically (...) naïve participants were given a problem analogous to that given in Experiment 1, framed verbally. Experiment 4 replicated Experiment 3 but added an “impossible to determine” response option. Models that rely on computing sample correlations make no predictions about these investigations. From a Bayesian perspective, participants’ inferences in all four experiments tended to make probabilistically valid inferences as long as the single datum was directional. The results are discussed in light of the Brunswikian notion of vicarious functioning. (shrink)