An important trend in contemporary epistemology centers on elaborating an old idea of pragmatist pedigree: theory selection (and in general the process of changing view and fixing beliefs) presupposes epistemic values. This article focuses on analyzing the case where epistemic values are indeterminate or when the sources of valuation are multiple (epistemic values like coherence and simplicity need not order options in compatible ways). According to the theory that thus arises epistemic alternatives need not be fully ordered by an underlying (...) notion of information-value and therefore the usual economic techniques of optimization cannot be applied in order to compute optimal contractions. But in cases of this sort it is still rational to maximize, i.e. to deem an option as choosable when it is not known to be worse that any other. We present here basic results about a notion of liberal contraction based on maximizing quasi-orderings. This requires the previous solution of some open problems in the theory of rational choice functions, namely a full characterization of choice functions rationalizable in terms of maximization of quasi-transitive relations. We conclude by discussing the problem of what is the adequate feasible set for calculating maximizing solutions for contraction problems and by considering the epistemological roots of some counterexamples against the most fundamental axioms on choice functions (like α). While the first part of the paper shows how economic insights can be used to improve our understanding of the principles of belief formation and change, this final section reverses this strategy by showing the utility of epistemological insights and techniques for providing invariance conditions capable of regulating the applicability of the pure principles of choice. (shrink)

There is some consensus on the claim that imagination as suppositional thinking can have epistemic value insofar as it’s constrained by a principle of minimal alteration of how we know or believe reality to be – compatibly with the need to accommodate the supposition initiating the imaginative exercise. But in the philosophy of imagination there is no formally precise account of how exactly such minimal alteration is to work. I propose one. I focus on counterfactual imagination, arguing that this can (...) be modeled as simulated belief revision governed by Laplacian imaging. So understood, it can be rationally justified by accuracy considerations: it minimizes expected belief inaccuracy, as measured by the Brier score. (shrink)

We propose a new account of indicative conditionals, giving acceptability and logical closure conditions for them. We start from Adams’ Thesis: the claim that the acceptability of a simple indicative equals the corresponding conditional probability. The Thesis is widely endorsed, but arguably false and refuted by empirical research. To fix it, we submit, we need a relevance constraint: we accept a simple conditional 'If φ, then ψ' to the extent that (i) the conditional probability p(ψ|φ) is high, provided that (ii) (...) φ is relevant for ψ. How (i) should work is well-understood. It is (ii) that holds the key to improve our understanding of conditionals. Our account has (i) a probabilistic component, using Popper functions; (ii) a relevance component, given via an algebraic structure of topics or subject matters. We present a probabilistic logic for simple indicatives, and argue that its (in)validities are both theoretically desirable and in line with empirical results on how people reason with conditionals. (shrink)

The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness results for normal systems without the Barcan Formula (like (...) FOL + K)in terms of neighborhood frames with constant domains. The first order models we present permit the study of many epistemic modalities recently proposed in computer science as well as the development of adequate models for monadic operators of high probability. Models of this type are either difficult of impossible to build in terms of relational Kripkean semantics [40].We conclude by introducing general first order neighborhood frames with constant domains and we offer a general completeness result for the entire family of classical first order modal systems in terms of them, circumventing some well-known problems of propositional and first order neighborhood semantics (mainly the fact that many classical modal logics are incomplete with respect to an unmodified version of either neighborhood or relational frames). We argue that the semantical program that thus arises offers the first complete semantic unification of the family of classical first order modal logics. (shrink)

Henry Kyburg’s lottery paradox (1961, p. 197) arises from considering a fair 1000 ticket lottery that has exactly one winning ticket. If this much is known about the execution of the lottery it is therefore rational to accept that one ticket will win. Suppose that an event is very likely if the probability of its occurring is greater than 0.99. On these grounds it is presumed rational to accept the proposition that ticket 1 of the lottery will not win. Since (...) the lottery is fair, it is rational to accept that ticket 2 won’t win either—indeed, it is rational to accept for any individual ticket i of the lottery that ticket i will not win. However, accepting that ticket 1 won’t win, accepting that ticket 2 won’t win, . . . , and accepting that ticket 1000 won’t win entails that it is rational to accept that no ticket will win, which entails that it is rational to accept the contradictory proposition that one ticket wins and no ticket wins. (shrink)

We defend a set of acceptance rules that avoids the lottery paradox, that is closed under classical entailment, and that accepts uncertain propositions without ad hoc restrictions. We show that the rules we recommend provide a semantics that validates exactly Adams’ conditional logic and are exactly the rules that preserve a natural, logical structure over probabilistic credal states that we call probalogic. To motivate probalogic, we first expand classical logic to geo-logic, which fills the entire unit cube, and then we (...) project the upper surfaces of the geo-logical cube onto the plane of probabilistic credal states by means of standard, linear perspective, which may be interpreted as an extension of the classical principle of indifference. Finally, we apply the geometrical/logical methods developed in the paper to prove a series of trivialization theorems against question-invariance as a constraint on acceptance rules and against rational monotonicity as an axiom of conditional logic in situations of uncertainty. (shrink)

We examine the notion of conditionals and the role of conditionals in inductive logics and arguments. We identify three mistakes commonly made in the study of, or motivation for, non-classical logics. A nonmonotonic consequence relation based on evidential probability is formulated. With respect to this acceptance relation some rules of inference of System P are unsound, and we propose refinements that hold in our framework.

Rescorla explores the relation between Reflection, Conditionalization, and Dutch book arguments in the presence of a weakened concept of sure loss and weakened conditions of self‐transparency for doxastic agents. The literature about Reflection and about Dutch Book arguments, though overlapping, are distinct, and its history illuminates the import of Rescorla's investigation. With examples from a previous debate in the 70s and results about Reflection and Conditionalization in the 80s, I propose a way of seeing the epistemic enterprise in the light (...) of practical requirements to be met by demands for synchronic coherence and probability updating policies. This includes a defense of principles rejected by Rescorla, while allowing for the value of his results in the borderland between theories of cognition and formal epistemology. (shrink)

We explore ways in which purely qualitative belief change in the AGM tradition throws light on options in the treatment of conditional probability. First, by helping see why it can be useful to go beyond the ratio rule defining conditional from one-place probability. Second, by clarifying what is at stake in different ways of doing that. Third, by suggesting novel forms of conditional probability corresponding to familiar variants of qualitative belief change, and conversely. Likewise, we explain how recent work on (...) the qualitative part of probabilistic inference leads to a very broad class of 'proto-probability' functions. (shrink)

I show that the Lottery Paradox is just a version of the Sorites, and argue that this should modify our way of looking at the Paradox itself. In particular, I focus on what I call “the Cut-off Point Problem” and contend that this problem, well known by Sorites scholars, ought to play a key role in the debate on Kyburg’s puzzle. Very briefly, I show that, in the Lottery Paradox, the premises “ticket n°1 will lose”, “ticket n°2 will lose”… “ticket (...) n°1000 will lose” are equivalent to soritical premises of the form “~(the winning ticket is in {…, (tn)}) ⊃ ~(the winning ticket is in {…, tn, (tn + 1)})” (where “⊃” is the material conditional, “~” is the negation symbol, “tn” and “tn + 1” are “ticket n°n” and “ticket n°n + 1” respectively, and “{}” identify the elements of the lottery tickets’ set. The brackets in “(tn)” and “(tn + 1)” are meant to point out that in the antecedent of the conditional we do not always have a “tn” (and, as a result, a “tn + 1” in the consequent): consider the conditional “~(the winning ticket is in {}) ⊃ ~(the winning ticket is in {t1})”). As a result, failing to believe, for some ticket, that it will lose comes down to introducing a cut-off point in a chain of soritical premises. In this paper I explore the consequences of the different ways of blocking the Lottery Paradox with respect to the Cut-off Point Problem. A heap variant of the Lottery Paradox is especially relevant for evaluating the different solutions. One important result is that the most popular way out of the puzzle, i.e., denying the Lockean Thesis, becomes less attractive. Moreover, I show that, along with the debate on whether rational belief is closed under classical logic, the debate on the validity of modus ponens should play an important role in discussions on the Lottery Paradox. -/- . (shrink)

This essay develops a joint theory of rational (all-or-nothing) belief and degrees of belief. The theory is based on three assumptions: the logical closure of rational belief; the axioms of probability for rational degrees of belief; and the so-called Lockean thesis, in which the concepts of rational belief and rational degree of belief figure simultaneously. In spite of what is commonly believed, this essay will show that this combination of principles is satisfiable (and indeed nontrivially so) and that the principles (...) are jointly satisfied if and only if rational belief is equivalent to the assignment of a stably high rational degree of belief. Although the logical closure of belief and the Lockean thesis are attractive postulates in themselves, initially this may seem like a formal “curiosity”; however, as will be argued in the rest of the essay, a very reasonable theory of rational belief can be built around these principles that is not ad hoc and that has various philosophical features that are plausible independently. In particular, this essay shows that the theory allows for a solution to the Lottery Paradox, and it has nice applications to formal epistemology. The price that is to be paid for this theory is a strong dependency of belief on the context, where a context involves both the agent's degree of belief function and the partitioning or individuation of the underlying possibilities. But as this essay argues, that price seems to be affordable. (shrink)

Is it possible to give an explicit definition of belief in terms of subjective probability, such that believed propositions are guaranteed to have a sufficiently high probability, and yet it is neither the case that belief is stripped of any of its usual logical properties, nor is it the case that believed propositions are bound to have probability 1? We prove the answer is ‘yes’, and that given some plausible logical postulates on belief that involve a contextual “cautiousness” threshold, there (...) is but one way of determining the extension of the concept of belief that does the job. The qualitative concept of belief is not to be eliminated from scientific or philosophical discourse, rather, by reducing qualitative belief to assignments of resiliently high degrees of belief and a “cautiousness” threshold, qualitative and quantitative belief turn out to be governed by one unified theory that offers the prospects of a huge range of applications. Within that theory, logic and probability theory are not opposed to each other but go hand in hand. (shrink)

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)

There are several approaches implementing reasoning based on conditional knowledge bases, one of the most popular being System Z (Pearl, Proceedings of the 3rd conference on theoretical aspects of reasoning about knowledge, TARK ’90, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp. 121–135, 1990). We look at ranking functions (Spohn, The Laws of Belief: Ranking Theory and Its Philosophical Applications, Oxford University Press, Oxford, 2012) in general, conditional structures and c-representations (Kern-Isberner, Conditionals in Nonmonotonic Reasoning and Belief Revision: Considering (...) Conditionals as Agents, vol. 2087 of LNCS, Springer, Berlin, 2001) in order to examine the reasoning strength of the different approaches by learning which of the known calculi of nonmonotonic reasoning (System P and R) and Direct Inference are applicable to these inference relations. Furthermore we use the recently proposed Enforcement-postulate (Kern-Isberner and Krümpelmann, Proceedings of the 22nd international joint conference on artificial intelligence, vol. 2, IJCAI’11, AAAI Press, pp. 937–942, 2011) to show dependencies between these approaches. (shrink)

One interpretation of the conditional If P then Q is as saying that the probability of Q given P is high. This is an interpretation suggested by Adams (1966) and pursued more recently by Edgington (1995). Of course, this probabilistic conditional is nonmonotonic, that is, if the probability of Q given P is high, and R implies P, it need not follow that the probability of Q given R is high. If we were confident of concluding Q from the fact (...) that we knew P, and we have stronger information R, we can no longer be confident of Q. We show nonetheless that usually we would still be justified in concluding Q from R. In other words, probabilistic conditionals are mostly monotonic. (shrink)

Coherence is a key concept in many accounts of epistemic justification within ‘traditional’ analytic epistemology. Within formal epistemology, too, there is a substantial body of research on coherence measures. However, there has been surprisingly little interaction between the two bodies of literature. The reason is that the existing formal literature on coherence measure operates with a notion of belief system that is very different from—what we argue is—a natural Bayesian formalisation of the concept of belief system from traditional epistemology. Therefore, (...) formal epistemology has so far only been concerned with one particular—arguably not even very natural—way of formalising coherence of belief systems; it has by no means refuted the viability of coherentism. In contrast to the existing literature, we formalise belief systems as families of assignments of (conditional) degrees of belief (which may be compatible with several subjective probability measures). Within this framework, we propose a Bayesian formalisation of the thrust of BonJour’s coherence concept in The structure of empirical knowledge (Harvard University Press, Cambridge, 1985), using a combination of Bayesian confirmation theory and basic graph theory. In excursions, we introduce graded notions for both logical and probabilistic consistency of belief systems—the latter being based on certain geometrical structures induced by probabilistic belief systems. For illustration, we reconsider BonJour’s “ravens” challenge (op. cit., p. 95f.). Finally, potential objections to our proposed formal coherence notion are explored. (shrink)

I’ll describe a range of systems for nonmonotonic conditionals that behave like conditional probabilities above a threshold. The rules that govern each system are probabilistically sound in that each rule holds when the conditionals are interpreted as conditional probabilities above a threshold level specific to that system. The well-known preferential and rational consequence relations turn out to be special cases in which the threshold level is 1. I’ll describe systems that employ weaker rules appropriate to thresholds lower than 1, and (...) compare them to these two standard systems. (shrink)

In standard Bayesian probability revision, the adoption of full beliefs (propositions with probability 1) is irreversible. Once an agent has full belief in a proposition, no subsequent revision can remove that belief. This is an unrealistic feature, and it also makes probability revision incompatible with belief change theory, which focuses on how the set of full beliefs is modified through both additions and retractions. This problem in probability theory can be solved in a model that (i) lets the codomain of (...) the probability function be a hyperreal-valued rather than the real-valued closed interval [0, 1], and (ii) identifies the full beliefs as the propositions whose probability is either 1 or infinitesimally smaller than 1. In this model, changes in the probability function will result in changes in the set of full beliefs (belief set), which constitutes a submodel that can be conceived as the “tip of the iceberg” within the larger model that also contains beliefs on lower levels of probability. The patterns of change in the set of full beliefs in this modified Bayesian model coincides with the corresponding pattern in a slightly modified version of AGM revision, which is commonly conceived as the gold standard of (dichotomous) belief change. The modification only concerns the marginal case of revision by an inconsistent input sentence. These results show that probability revision and dichotomous belief change can be unified in one and the same framework, or – if we so wish – that belief change theory can be subsumed under a modified version of probability revision that allows for iterated change and for the removal of full beliefs. (shrink)

My goal, in this paper, is to critically assess the categorization of “interpretations of probability” as it appears in the literature. In some sources only Carnap’s treatment of probability is understood to be the best example of “logical” probability. This is surprisingly narrow and I will here suggest otherwise. In fact, I believe that certain forms of Baysianism should also be included in the logical camp.