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)

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

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

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

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

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

Comparativism is the view that comparative confidences (e.g., being more confident that P than that Q) are more fundamental than degrees of belief (e.g., believing that P with some strength x). In this paper, I outline the basis for a new, non-probabilistic version of comparativism inspired by a suggestion made by Frank Ramsey in `Probability and Partial Belief'. I show how, and to what extent, `Ramseyan comparativism' might be used to weaken the (unrealistically strong) probabilistic coherence conditions (...) that comparativism traditionally relies on. (shrink)

Various semantics for studying the square of opposition and the hexagon of opposition have been proposed recently. We interpret sentences by imprecise (set-valued) probability assessments on a finite sequence of conditional events. We introduce the acceptability of a sentence within coherence-based probability theory. We analyze the relations of the square and of the hexagon in terms of acceptability. Then, we show how to construct probabilistic versions of the square and of the hexagon of opposition by forming suitable tripartitions of (...) the set of all coherent assessments. Finally, as an application, we present new versions of the square and of the hexagon involving generalized quantifiers. (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)

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

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

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

In this article, I introduce the term “cognitivism” as a name for the thesis that degrees of belief are equivalent to full beliefs about truth-valued propositions. The thesis (of cognitivism) that degrees of belief are equivalent to full beliefs is equivocal, inasmuch as different sorts of equivalence may be postulated between degrees of belief and full beliefs. The simplest sort of equivalence (and the sort of equivalence that I discuss here) identifies having a given degree of belief with having a (...) full belief with a specific content. This sort of view was proposed in [C. Howson and P. Urbach, Scientific reasoning: the Bayesian approach. Chicago: Open Court (1996)].In addition to embracing a form of cognitivism about degrees of belief, Howson and Urbach argued for a brand of probabilism. I call a view, such as Howson and Urbach’s, which combines probabilism with cognitivism about degrees of belief “cognitivist probabilism”. In order to address some problems with Howson and Urbach’s view, I propose a view that incorperates several of modifications of Howson and Urbach’s version of cognitivist probabilism. The view that I finally propose upholds cognitivism about degrees of belief, but deviates from the letter of probabilism, in allowing that a rational agent’s degrees of belief need not conform to the axioms of probability, in the case where the agent’s cognitive resources are limited. (shrink)

The best and most popular argument for probabilism is the accuracy-dominance argument, which purports to show that alethic considerations alone support the view that an agent’s degrees of belief should always obey the axioms of probability. I argue that extant versions of the accuracy-dominance argument face a problem. In order for the mathematics of the argument to function as advertised, we must assume that every omniscient credence function is classically consistent; there can be no worlds in the set of dominance-relevant (...) worlds that obey some other logic. This restriction cannot be motivated on alethic grounds unless we’re also willing to accept that rationality requires belief in every metaphysical necessity, as the distinction between a priori logical necessities and a posteriori metaphysical ones is not an alethic distinction. To justify the restriction to classically consistent worlds, non-alethic motivation is required. And thus, if there is a version of the accuracy-dominance argument in support of probabilism, it isn’t one that is grounded in alethic considerations alone. (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)

Theorists have consistently maintained that the most plausible forms of objective consequentialism must be probabilistic if and only if indeterminism is true. This standard position, however popular, lacks sufficient motivation. Assume determinism to be true and an attempt will be made to show that attractive forms of objective consequentialism must be probabilistic - and not for reasons related to our epistemic limitations either. -/- Here it is argued that all extant objective formulations of consequentialism fail to deliver the (...) normative implications that the spirit of objective consequentialism requires. My argument rests upon the claim that certain pairs of subjunctive conditionals with identical antecedents and incompatible consequents are such that neither of the pair is true. -/- Upon leveling the objection, the concept of an "objective" subjunctive probability is introduced and utilized in the transformation of a subjective version of expected act utility consequentialism into an objective version, one that is capable of dealing with the difficulties posed by the objection. I end by indicating some ways in which the closest thing to a plausible, objective form of consequentialism might be developed. (shrink)

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)

In ethics, ‘probabilism’ refers to a position defended by a number of Catholic theologians, mainly in the sixteenth and seventeenth centuries. They held that, when one is uncertain which of a range of actions is the right one to perform, it is permissible to perform any which has a good chance of being the right one—even if there is another which has a better chance. This paper considers the value of this position from the viewpoint of modern ethical philosophy. The (...) unusual nature of probabilism as a theory focusing upon permissibility, rather than right-making properties, is explored and related to some modern attempts to set out ‘satisficing’ and ‘hybrid’ ethical theories. Such theories try to distinguish between what is best and what is permissible, and probabilism can be understood as an alternative way of supplementing a theory of right-making properties by adding to it a theory of permissibility. But a more radical version is also possible, where one abandons any attempt to identify right actions or right-making properties, and instead considers permissibility alone. Accordingly, a ‘multi-account theory’ of permissibility is proposed and defended as a model of how many people actually make moral decisions. (shrink)

On explanationist accounts of genealogical debunking, roughly, a belief is debunked when its explanation is not suitably related to its content. We argue that explanationism cannot accommodate cases in which beliefs are explained by factors unrelated to their contents but are nonetheless independently justified. Justification-specific versions of explanationism face an iteration of the problem. The best account of debunking is a probabilistic account according to which subject S’s justification J for their belief that P is debunked when S learns (...) that J is no more likely to be true on the hypothesis that P than on the hypothesis that ¬P. The probabilistic criterion is fully general, applying not only to cases where the learned undercutting defeater is a proposition about our beliefs or other mental states but to any case of undercutting defeat, providing the grounds for a debunking argument against the existence of a special, metacognitive debunking principle. (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)

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

This paper discusses two versions of reliabilism: modal and probabilistic reliabilism. Modal reliabilism faces the problem of the missing closeness metric for possible worlds while probalistic reliabilism faces the problem of the relevant reference class. Despite the severity of these problems, reliabilism is still very plausible (also for independent reasons). I propose to stick with reliabilism, propose a contextualist (or, alternatively, harmlessly relativist) solution to the above problems and suggest that probabilistic reliabilism has the advantage over modal reliabilism.

In my article, I present a new version of a probabilistic truth prescribing semantics for natural language indicative conditionals. The proposed truth conditions can be paraphrased as follows: an indicative conditional is true if the corresponding conditional probability is high and the antecedent is positively probabilistically relevant for the consequent or the probability of the antecedent of the conditional equals 0. In the paper, the truth conditions are defended and some of the logical properties of the proposed semantics (...) are described. (shrink)

The author uses a series of examples to illustrate two versions of a new, nonprobabilist principle of epistemic rationality, the special and general versions of the metacognitive, expected relative frequency principle. These are used to explain the rationality of revisions to an agent’s degrees of confidence in propositions based on evidence of the reliability or unreliability of the cognitive processes responsible for them—especially reductions in confidence assignments to propositions antecedently regarded as certain—including certainty-reductions to instances of the law of excluded (...) middle or the law of noncontradiction in logic or certainty-reductions to the certainties of probabilist epistemology. The author proposes special and general versions of the MERF principle and uses them to explain the examples, including the reasoning that would lead to thoroughgoing fallibilism—that is, to a state of being certain of nothing. The author responds to the main defenses of probabilism: Dutch Book arguments, Joyce’s potential accuracy defense, and the potential calibration defenses of Shimony and van Fraassen by showing that, even though they do not satisfy the probability axioms, degrees of belief that satisfy the MERF principle minimize expected inaccuracy in Joyce’s sense; they can be externally calibrated in Shimony and van Fraassen’s sense; and they can serve as a basis for rational betting, unlike probabilist degrees of belief, which, in many cases, human beings have no rational way of ascertaining. The author also uses the MERF principle to subsume the various epistemic akrasia principles in the literature. Finally, the author responds to Titelbaum’s argument that epistemic akrasia principles require that we be certain of some epistemological beliefs, if we are rational. (shrink)

Fitch’s paradox shows, from fairly innocent-looking assumptions, that if there are any unknown truths, then there are unknowable truths. This is generally thought to deliver a blow to antirealist positions that imply that all truths are knowable. The present paper argues that a probabilistic version of antirealism escapes Fitch’s result while still offering all that antirealists should care for.

In addition to beliefs, people have attitudes of confidence called credences. Combinations of credences, like combinations of beliefs, can be inconsistent. It is common to use tools from probability theory to understand the normative relationships between a person’s credences. More precisely, it is common to think that something is a consistency norm on a person’s credal state if and only if it is a simple transformation of a truth of probability. Though it is common to challenge the right-to-left direction of (...) this biconditional, I argue in this paper that the left-to-right direction is false for standard versions of probability theory. That is, I make the case that there are consistency constraints on credal states that are not simple transformations of truths of standard versions of probability theory. I do so by drawing on a newly discovered type of credal attitude, a quantificational credence, and by showing how the consistency norms on this attitude can’t be represented as simple transformations of truths of standard versions of probability theory. I conclude by showing that a probability theory that could avoid the result would have to be strikingly different from the standard versions—so different that I suspect many would hesitate to call it a theory of probability at all. (shrink)

In this paper I start by briefly presenting an analysis of token cause and of token causal relevance that I developed elsewhere, and then apply it to the famous thirsty traveler riddle. One general outcome of the analysis of causal relevance employed here is that in preemption cases (early or late) the preempted cause is not a cause since it is causally irrelevant to the effect. I consider several variations of the thirsty traveler riddle. In the first variation the first (...) enemy emptied the canteen and the second enemy threw it away. On this variation, the act of neither enemy comes out, on the analysis employed here, as causally relevant to, and thus not as a cause of, the fact that the traveler died, but the conjunction of the two acts is a cause of it. This version is a case of mutual preemption. I argue that it has the same structure as the voting paradox, which thus has an analogous solution. In the standard version, in which the first enemy added poison to the water in the traveler's canteen, the act of the second enemy (who threw the canteen away) comes out, on the analysis used here, as causally relevant to and as a cause of the fact that the traveler died, but the act of the first enemy comes out as neither. I also make a comparison with Lewis' accounts, and discuss alternative treatments of the puzzle such as those of Hart and Honore and of Gavison, Margalit, and Ullmann-Margalit. (shrink)

This paper introduces the logic of evidence and truth \ as an extension of the Belnap–Dunn four-valued logic \. \ is a slightly modified version of the logic \, presented in Carnielli and Rodrigues. While \ is equipped only with a classicality operator \, \ is equipped with a non-classicality operator \ as well, dual to \. Both \ and \ are logics of formal inconsistency and undeterminedness in which the operator \ recovers classical logic for propositions in its (...) scope. Evidence is a notion weaker than truth in the sense that there may be evidence for a proposition \ even if \ is not true. As well as \, \ is able to express preservation of evidence and preservation of truth. The primary aim of this paper is to propose a probabilistic semantics for \ where statements \\) and \\) express, respectively, the amount of evidence available for \ and the degree to which the evidence for \ is expected to behave classically—or non-classically for \ \). A probabilistic scenario is paracomplete when \ + P 1\), and in both cases, \ < 1\). If \ = 1\), or \ = 0\), classical probability is recovered for \. The proposition \, a theorem of \, partitions what we call the information space, and thus allows us to obtain some new versions of known results of standard probability theory. (shrink)

There is a well-documented paradigm-shift in eighteenth century Jesuit philosophy and science, at the very least in Central Europe: traditional scholastic version(s) of Aristotelianism were replaced by early modern rationalism (Wolff's systematisation of Leibnizian philosophy) and early modern science and mathematics. In the field of probability, this meant that the traditional Jesuit engagement with probability, uncertainty, and truthlikeness (in particular, as applied to moral theology) could translate into mathematical language, and can be analysed against the background of the accounts (...) of probability, pre-mathematical Jesuit logic, Wolff's conceptual analysis, and Bernoullian mathematisation. The works of two Jesuit philosophers, Berthold Hauser and Sigismund Storchenau, can be related to this context. The core of their logic of (epistemic) probability is the account of negation (or ‘contradiction’) and implication (or ‘argument’), in particular, the algorithms for computing the reliability of one piece of evidence when compared to the respective counter-evidence and for computing the probability of a conclusion given the probability of its premises. (shrink)

In teaching statistics in secondary schools and at university, two visualizations are primarily used when situations with two dichotomous characteristics are represented: 2×2 tables and tree diagrams. Both visualizations can be depicted either with probabilities or with frequencies. Visualizations with frequencies have been shown to help students significantly more in Bayesian reasoning problems than probability visualizations do. Because tree diagrams or double-trees (which are largely unknown in school) are node-branch-structures, these two visualizations (compared to the 2×2 table) can even simultaneously (...) display probabilities on branches and frequencies inside the nodes. This is a teaching advantage as it allows the frequency concept to be used to better understand probabilities. However, 2×2 tables and (double-) trees have a decisive disadvantage: While joint probabilities (e.g., P(AB)) are represented in 2×2 tables but no conditional probabilities (e.g., P(A|B)), it is exactly the other way around with (double-) trees. Therefore, a visualization that is equally suitable for the representation of joint probabilities and conditional probabilities is desirable. In this article, we present a new visualization—the frequency net—in which all absolute frequencies and all types of probabilities can be depicted. In addition to a detailed theoretical analysis of the frequency net, we report the results of a study with 249 university students that shows that “net diagrams” can improve reasoning without previous instruction to a similar extent as 2×2 tables and double-trees. Regarding questions about conditional probabilities, frequency visualizations (2×2 table, double-tree, or net diagram with natural frequencies) are consistently superior to probability visualizations. The frequency net performs as well as the frequency double-tree. Only the 2×2 table with frequencies—the only visualization that participants were already familiar with —led to higher performance rates. If, on the other hand, a question about a joint probability had to be answered, all implemented visualizations clearly supported participants’ performance, and no uniform format effect becomes visible. Participants reached the highest performance in the versions with probability 2×2 tables and probability net diagrams. Furthermore, after conducting a detailed error analysis, we report interesting error shifts between the two information formats and the different visualizations and give recommendations for teaching probability. (shrink)

A procedure is given for the transformation of quantum mechanical operator equations into stochastic equations. The stochastic equations reveal a simple correlation between quantum mechanics and classical mechanics: Quantum mechanics operates with “optimal estimations,” classical mechanics is the limit of “complete information.” In this connection, Schrödinger's substitution relationsp x → -iħ ∂/∂x, etc, reveal themselves as exact mathematical transformation formulas. The stochastic version of quantum mechanical equations provides an explanation for the difficulties in correlating quantum mechanics and the theory (...) of relativity: In physics “time” is always thought of as a numerical parameter; but in the present formalism of physics “time” is described by two formally totally different quantities. One of these two “times” is a numerical parameter and the other a random variable. This last concept of time shows all the properties required by the theory of relativity and is therefore to be considered as the relativistic time. (shrink)

The unanimity theory is an account of property-level causation requiring that causes raise the probability of their effects in specified test situations. Richard Otte (1981) and others have presented counterexamples in which one property is probabilistically sufficient for at least one other property. Given the continuing discussion (e.g., Cartwright 1989; Cartwright and Dupre 1988; Eells 1988a,b), many apparently think that these problems are minor. By considering the impact of Otte's cases on recent versions of the theory, by raising several new (...) examples, and by criticizing natural replies, I argue that the problems for the unanimity theory are severe. (shrink)

In this paper, I develop a syntactic framework for the analysis ofstrategic form games that is based on a straightforward combination ofstandard systems of doxastic, probabilistic and conditionalpropositional logic. In particular, for the probabilistic part I makeuse of the axiomatization provided in Fagin and Halpern (1994). The use ofconditionals allows to represent a strategic form game by a logicalformula in a very natural way. Also expected utility maximization can benaturally captured. I use this framework to prove a (...) class='Hi'>version of a resulton Nash equilibrium conjectures first presented in Aumann and Brandenburger (1995). (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)

Truthlikeness is a property of a theory or a proposition that represents its closeness to the truth. We start by summarizing Niiniluoto’s proposal of truthlikeness for deterministic laws, which defines truthlikeness as a function of accuracy, and García-Lapeña’s expanded version, which defines truthlikeness for DL as a function of two factors, accuracy and nomicity. Then, we move to develop an appropriate definition of truthlikeness for probabilistic laws based on Niiniluoto’s suggestion to use the Kullback–Leibler divergence to define the (...) distance between a probability law X\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$X$$\end{document} and the true probability law T\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T$$\end{document}. We argue that the Kullback–Leibler divergence seems to be the best of the available probability distances to measure accuracy between PL. However, as in the case of DL, we argue that accuracy represents a necessary but not sufficient condition, as two PL may be equally accurate and still one may imply more true or truthlike consequences, behaviours or true facts about the system than the other. The final proposal defines truthlikeness for PL as a function of two factors, p-accuracy and p-nomicity, in intimate connexion with García-Lapeña’s proposal for DL. (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)

A new version of quantum theory is proposed, according to which probabilistic events occur whenever new statioinary or bound states are created as a result of inelastic collisions. The new theory recovers the experimental success of orthodox quantum theory, but differs form the orthodox theory for as yet unperformed experiments.

The aim of my paper is to clarify the conceptions of epistemic deism and probabilistic theism and to demonstrate that the two doctrines do not finally collapse into one. I would like also to point some reasons for the acceptance of a certain version of probabilistic theism which I will call in the last part of the article “open probabilistic theism”. Open probabilistic theism is not a version of the view called “open theism”. The (...) reasons for the openness of open probabilistic theism are quite different from the reasons supporting open theism. (shrink)

Acknowledgements Andrea Scarantino, Nicholas Shea, Mark Sprevak, and three anonymous referees provided incisive and constructive comments, for which I am very grateful. In 2012, earlier versions of this paper were delivered in Edinburgh, at the Joint Session in Stirling, and at a workshop on natural information in Aberdeen. I thank participants for their feedback.

The Dutch Book Argument for Probabilism assumes Ramsey's Thesis (RT), which purports to determine the prices an agent is rationally required to pay for a bet. Recently, a new objection to Ramsey's Thesis has emerged (Hedden 2013, Wronski & Godziszewski 2017, Wronski 2018)--I call this the Expected Utility Objection. According to this objection, it is Maximise Subjective Expected Utility (MSEU) that determines the prices an agent is required to pay for a bet, and this often disagrees with Ramsey's Thesis. I (...) suggest two responses to Hedden's objection. First, we might be permissive: agents are permitted to pay any price that is required or permitted by RT, and they are permitted to pay any price that is required or permitted by MSEU. This allows us to give a revised version of the Dutch Book Argument for Probabilism, which I call the Permissive Dutch Book Argument. Second, I suggest that even the proponent of the Expected Utility Objection should admit that RT gives the correct answer in certain very limited cases, and I show that, together with MSEU, this very restricted version of RT gives a new pragmatic argument for Probabilism, which I call the Bookless Pragmatic Argument. (shrink)

Harold Jeffreys' ideas on the interpretation of probability and epistemology are reviewed. It is argued that with regard to the interpretation of probability, Jeffreys embraces a version of logicism that shares some features of the subjectivism of Ramsey and de Finetti. Jeffreys also developed a probabilistic epistemology, characterized by a pragmatical and constructivist attitude towards notions such as ‘objectivity’, ‘reality’ and ‘causality’. 1 Introductory remarks 2 The interpretation of probability 3 Jeffreys' probabilistic epistemology.

PROBEX (PROBabilities from EXemplars), a model of probabilistic inference and probability judgment based on generic knowledge is presented. Its properties are that: (a) it provides an exemplar model satisfying bounded rationality; (b) it is a “lazy” algorithm that presumes no pre‐computed abstractions; (c) it implements a hybrid‐representation, similarity‐graded probability. We investigate the ecological rationality of PROBEX and find that it compares favorably with Take‐The‐Best and multiple regression (Gigerenzer, Todd, & the ABC Research Group, 1999). PROBEX is fitted to the (...) point estimates, decisions, and probability assessments by human participants. The best fit is obtained for a version that weights frequency heavily and retrieves only two exemplars. It is proposed that PROBEX implements speed and frugality in a psychologically plausible way. (shrink)

Recent work on hypercomputation has raised new objections against the Church–Turing Thesis. In this paper, I focus on the challenge posed by a particular kind of hypercomputer, namely, SAD computers. I first consider deterministic and probabilistic barriers to the physical possibility of SAD computation. These suggest several ways to defend a Physical version of the Church–Turing Thesis. I then argue against Hogarth's analogy between non-Turing computability and non-Euclidean geometry, showing that it is a non-sequitur. I conclude that the (...) Effective version of the Church–Turing Thesis is unaffected by SAD computation. (shrink)

Physicists routinely claim that the fundamental laws of physics are 'time symmetric' or 'time reversal invariant' or 'reversible'. In particular, it is claimed that the theory of quantum mechanics is time symmetric. But it is shown in this paper that the orthodox analysis suffers from a fatal conceptual error, because the logical criterion for judging the time symmetry of probabilistic theories has been incorrectly formulated. The correct criterion requires symmetry between future-directed laws and past-directed laws. This criterion is formulated (...) and proved in detail. The orthodox claim that quantum mechanics is reversible is re-evaluated. The property demonstrated in the orthodox analysis is shown to be quite distinct from time reversal invariance. The view of Satosi Watanabe that quantum mechanics is time asymmetric is verified, as well as his view that this feature does not merely show a de facto or 'contingent' asymmetry, as commonly supposed, but implies a genuine failure of time reversal invariance of the laws of quantum mechanics. The laws of quantum mechanics would be incompatible with a time-reversed version of our universe. (shrink)

We introduce an epistemic theory of truth according to which the same rational degree of belief is assigned to Tr(. It is shown that if epistemic probability measures are only demanded to be finitely additive (but not necessarily σ-additive), then such a theory is consistent even for object languages that contain their own truth predicate. As the proof of this result indicates, the theory can also be interpreted as deriving from a quantitative version of the Revision Theory of Truth.

What are quantum entities? Is the quantum domain deterministic or probabilistic? Orthodox quantum theory (OQT) fails to answer these two fundamental questions. As a result of failing to answer the first question, OQT is very seriously defective: it is imprecise, ambiguous, ad hoc, non-explanatory, inapplicable to the early universe, inapplicable to the cosmos as a whole, and such that it is inherently incapable of being unified with general relativity. It is argued that probabilism provides a very natural solution to (...) the quantum wave/particle dilemma and promises to lead to a fully micro-realistic, testable version of quantum theory that is free of the defects of OQT. It is suggested that inelastic interactions may induce quantum probabilistic transitions. (shrink)

Three related intuitions are explicated in this paper. The first is the idea that there must be some kind of probabilistic version of the HD-method, a ‘Hypothetico-Probabilistic (HP-) method’, in terms of something like probabilistic consequences, instead of deductive consequences. According to the second intuition, the comparative application of this method should also be functional for some probabilistic kind of empirical progress, and according to the third intuition this should be functional for something like (...) class='Hi'>probabilistic truth approximation. In all three cases, the guiding idea is to explicate these intuitions by explicating the crucial notions as appropriate ‘concretizations’ of their deductive analogs, being ‘idealizations’. It turns out that the comparative version of the proposed HP-method amounts to the likelihood comparison (LC-) method applied to the cumulated evidence. This method turns out to be not only functional for probabilistic empirical progress but also for probabilistic truth approximation. The latter is based on a probabilistic threshold theorem constituting for this reason the analog of the deductive success theorem. (shrink)

Three related intuitions are explicated in this paper. The first is the idea that there must be some kind of probabilistic version of the HD-method, a 'Hypothetico-Probabilistic method', in terms of something like probabilistic consequences, instead of deductive consequences. According to the second intuition, the comparative application of this method should also be functional for some probabilistic kind of empirical progress, and according to the third intuition this should be functional for something like probabilistic (...) truth approximation. In all three cases, the guiding idea is to explicate these intuitions by explicating the crucial notions as appropriate 'concretizations' of their deductive analogs, being 'idealizations'. It turns out that the comparative version of the proposed HP-method amounts to the likelihood comparison method applied to the cumulated evidence. This method turns out to be not only functional for probabilistic empirical progress but also for probabilistic truth approximation. The latter is based on a probabilistic threshold theorem constituting for this reason the analog of the deductive success theorem. (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 (...) class='Hi'>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)