Until recently, it seemed like no theory about the relationship between rational credence and rational outright belief could reconcile three independently plausible assumptions: that our beliefs should be logically consistent, that our degrees of belief should be probabilistic, and that a rational agent believes something just in case she is sufficiently confident in it. Recently a new formal framework has been proposed that can accommodate these three assumptions, which is known as “the stability theory of belief” or “high probability cores.” (...) In this paper, I examine whether the stability theory of belief can meet two further constraints that have been proposed in the literature: that it is irrational to outright believe lottery propositions, and that it is irrational to hold outright beliefs based on purely statistical evidence. I argue that these two further constraints create a dilemma for a proponent of the stability theory: she must either deny that her theory is meant to give an account of the common epistemic notion of outright belief, or supplement the theory with further constraints on rational belief that render the stability theory explanatorily idle. This result sheds light on the general prospects for a purely formal theory of the relationship between rational credence and belief, i.e. a theory that does not take into account belief content. I argue that it is doubtful that any such theory could properly account for these two constraints, and hence play an important role in characterizing our common epistemic notion of outright belief. (shrink)

Conditionals somehow express conditional beliefs. However, conditional belief is a bi-propositional attitude that is generally not truth-evaluable, in contrast to unconditional belief. Therefore, this article opts for an expressivistic semantics for conditionals, grounds this semantics in the arguably most adequate account of conditional belief, that is, ranking theory, and dismisses probability theory for that purpose, because probabilities cannot represent belief. Various expressive options are then explained in terms of ranking theory, with the intention to set out a general interpretive scheme (...) that is able to account for the most variegated usage of conditionals. The Ramsey test is only the first option. Relevance is another, familiar, but little understood item, which comes in several versions. This article adds a further family of expressive options, which is able to subsume also counterfactuals and causal conditionals, and indicates at the end how this family allows for partial recovery of truth conditions for conditionals. (shrink)

This paper proposes a game-theoretic solution of the surprise examination problem. It is argued that the game of “matching pennies” provides a useful model for the interaction of a teacher who wants her exam to be surprising and students who want to avoid being surprised. A distinction is drawn between prudential and evidential versions of the problem. In both, the teacher should not assign a probability of zero to giving the exam on the last day. This representation of the problem (...) provides a diagnosis of where the backwards induction argument, which “proves” that no surprise exam is possible, is mistaken. (shrink)

Since rationality is a normative ideal, it is difficult to see how a theory of rationality might be subjected to empirical evaluation. This paper explores various aspects of this problem in relation to the work of L. J. Cohen, Amos Tversky and Daviel Kahneman, Ellery Eells, Isaac Levi, and Henry Kyburg. Special consideration is given to its significance for testing systems of inductive logic.

According to a captivating picture, epistemic justification is essentially a matter of epistemic or evidential likelihood. While certain problems for this view are well known, it is motivated by a very natural thought—if justification can fall short of epistemic certainty, then what else could it possibly be? In this paper I shall develop an alternative way of thinking about epistemic justification. On this conception, the difference between justification and likelihood turns out to be akin to the more widely recognised difference (...) between ceteris paribus laws and brute statistical generalisations. I go on to discuss, in light of this suggestion, issues such as classical and lottery-driven scepticism as well as the lottery and preface paradoxes. (shrink)

According to the principle of Conjunction Closure, if one has justification for believing each of a set of propositions, one has justification for believing their conjunction. The lottery and preface paradoxes can both be seen as posing challenges for Closure, but leave open familiar strategies for preserving the principle. While this is all relatively well-trodden ground, a new Closure-challenging paradox has recently emerged, in two somewhat different forms, due to Backes :3773–3787, 2019a) and Praolini :715–726, 2019). This paradox synthesises elements (...) of the lottery and the preface and is designed to close off the familiar Closure-preserving strategies. By appealing to a normic theory of justification, I will defend Closure in the face of this new paradox. Along the way I will draw more general conclusions about justification, normalcy and defeat, which bear upon what Backes :2877–2895, 2019b) has dubbed the ‘easy defeat’ problem for the normic theory. (shrink)

Many epistemologists have responded to the lottery paradox by proposing formal rules according to which high probability defeasibly warrants acceptance. Douven and Williamson present an ingenious argument purporting to show that such rules invariably trivialise, in that they reduce to the claim that a probability of 1 warrants acceptance. Douven and Williamson’s argument does, however, rest upon significant assumptions – amongst them a relatively strong structural assumption to the effect that the underlying probability space is both finite and uniform. In (...) this paper, I will show that something very like Douven and Williamson’s argument can in fact survive with much weaker structural assumptions – and, in particular, can apply to infinite probability spaces. (shrink)

There are circumstances in which we want to predict a series of interrelated events. Faced with such a prediction task, it is natural to consider logically inconsistent predictions to be irrational. However, it is possible to find cases where an inconsistent prediction has higher expected accuracy than any consistent prediction. Predicting tournaments in sports provides a striking example of such a case and I argue that logical consistency should not be a norm of rational predictions in these situations.

In this paper, I’ll survey a number of closure principles of epistemic justification and find them all wanting. However, it’ll be my contention that there’s a novel closure principle of epistemic justification that has the virtues of its close cousin closure principles, without their vices. This closure principle of epistemic justification can be happily thought of as a multi-premise closure principle and it cannot be used in Cartesian skeptical arguments that employ a closure principle of epistemic justification. In this way, (...) then, it represents marked improvement over other contemporary closure principles of epistemic justification that require both sacrificing multi-premise closure and forcing anti-Cartesian skeptics who reject the closure principle employed in certain Cartesian skeptical arguments to cast aside justification closure. (shrink)

Presents an analogue of the Preface Paradox for intention, and discusses possible implications for the philosophy of action.

This paper describes a formal measure of epistemic justification motivated by the dual goal of cognition, which is to increase true beliefs and reduce false beliefs. From this perspective the degree of epistemic justification should not be the conditional probability of the proposition given the evidence, as it is commonly thought. It should be determined instead by the combination of the conditional probability and the prior probability. This is also true of the degree of incremental confirmation, and I argue that (...) any measure of epistemic justification is also a measure of incremental confirmation. However, the degree of epistemic justification must meet an additional condition, and all known measures of incremental confirmation fail to meet it. I describe this additional condition as well as a measure that meets it. The paper then applies the measure to the conjunction fallacy and proposes an explanation of the fallacy. (shrink)

This manuscript presents a topological argumentation framework for modelling notions of evidence-based (i.e., justified) belief. Our framework relies on so-called topological evidence models to represent the pieces of evidence that an agent has at her disposal, and it uses abstract argumentation theory to select the pieces of evidence that the agent will use to define her beliefs. The tools from abstract argumentation theory allow us to model agents who make decisions in the presence of contradictory information. Thanks to this, it (...) is possible to define two new notions of beliefs, grounded beliefs and fully grounded beliefs. These notions are discussed in this paper, analysed and compared with the existing notion of topological justified belief. This comparison revolves around three main issues: closure under conjunction introduction, the level of consistency and their logical strength. (shrink)

In this paper, we compare and contrast two methods for the revision of qualitative beliefs. The first method is generated by a simplistic diachronic Lockean thesis requiring coherence with the agent’s posterior credences after conditionalization. The second method is the orthodox AGM approach to belief revision. Our primary aim is to determine when the two methods may disagree in their recommendations and when they must agree. We establish a number of novel results about their relative behavior. Our most notable finding (...) is that the inverse of the golden ratio emerges as a non-arbitrary bound on the Bayesian method’s free-parameter—the Lockean threshold. This “golden threshold” surfaces in two of our results and turns out to be crucial for understanding the relation between the two methods. (shrink)

The idea that knowledge can be extended by inference from what is known seems highly plausible. Yet, as shown by familiar preface paradox and lottery-type cases, the possibility of aggregating uncertainty casts doubt on its tenability. We show that these considerations go much further than previously recognized and significantly restrict the kinds of closure ordinary theories of knowledge can endorse. Meeting the challenge of uncertainty aggregation requires either the restriction of knowledge-extending inferences to single premises, or eliminating epistemic uncertainty in (...) known premises. The first strategy, while effective, retains little of the original idea—conclusions even of modus ponens inferences from known premises are not always known. We then look at the second strategy, inspecting the most elaborate and promising attempt to secure the epistemic role of basic inferences, namely Timothy Williamson’s safety theory of knowledge. We argue that while it indeed has the merit of allowing basic inferences such as modus ponens to extend knowledge, Williamson’s theory faces formidable difficulties. These difficulties, moreover, arise from the very feature responsible for its virtue- the infallibilism of knowledge. (shrink)

There are two ways of representing rational belief: qualitatively as yes-or-no belief, and quantitatively as degrees of belief. Standard rationality conditions are: consistency and logical closure, for qualitative belief, satisfaction of the probability axioms, for quantitative belief, and a relationship between qualitative and quantitative beliefs in accordance with the Lockean thesis. In this paper, it is shown that these conditions are inconsistent with each of three further rationality conditions: fallibilism, open-mindedness, and invariance under independent conceptual expansions. Restrictions of the Lockean (...) thesis that have been suggested in the literature cannot remove the inconsistency. In the outlook we discuss two alternative ways of dealing with this problem: restricting conjunctive closure or going for a dual system account. (shrink)

In this paper a theory of finitistic and frequentistic approximations — in short: f-approximations — of probability measures P over a countably infinite outcome space N is developed. The family of subsets of N for which f-approximations converge to a frequency limit forms a pre-Dynkin system $${{D\subseteq\wp(N)}}$$. The limiting probability measure over D can always be extended to a probability measure over $${{\wp(N)}}$$, but this measure is not always σ-additive. We conclude that probability measures can be regarded as idealizations of (...) limiting frequencies if and only if σ-additivity is not assumed as a necessary axiom for probabilities. We prove that σ-additive probability measures can be characterized in terms of so-called canonical and in terms of so-called full f-approximations. We also show that every non-σ-additive probability measure is f-approximable, though neither canonically nor fully f-approximable. Finally, we transfer our results to probability measures on open or closed formulas of first-order languages. (shrink)

Epistemologists have traditionally been concerned with two issues: the justification of particular beliefs or sets of beliefs, and claims to knowledge. I propose to examine the relative import of these questions by comparing the gravity of the threat posed by two sceptics: one who questions the justifiability of our beliefs, and one who doubts our knowledge claims.

Much linguistic evidence supports the view believing something only requires thinking it likely. I assess and reject a rival view, based on recent work on homogeneity in natural language, according to which belief is a strong, demanding attitude. I discuss the implications of the linguistic considerations about ‘believe’ for our philosophical accounts of belief.

The paper explores a structural account of propositional justification in terms of the notion of being in a position to know and negation. Combined with a non-normal logic for being in a position to know, the account allows for the derivation of plausible principles of justification. The account is neutral on whether justification is grounded in internally individuated mental states, and likewise on whether it is grounded in facts that are already accessible by introspection or reflection alone. To this extent, (...) it is compatible both with internalism and with externalism about justification. Even so, the account allows for the proof of principles that are commonly conceived to depend on an internalist conception of justification. The account likewise coheres both with epistemic contextualism and with its rejection, and is compatible both with the knowledge-first approach and with its rejection. Despite its neutrality on these issues, the account makes propositional justification luminous and so is controversial. However, it proves quite resilient in the light of recent anti-luminosity arguments. (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)

1. In May 2013 I had an email exchange with Philippe Besnard, continued in September that year, on his paper with Amgoud and Besnard (2013) and its relevance for the ASPIC+ framework (Modgil & Prak...

It is well-known that versions of the lottery paradox and of the preface paradox show that the following three principles are jointly inconsistent: (Sufficiency) very probable propositions are justifiably believable; (Conjunction Closure) justified believability is closed under conjunction introduction; (No Contradictions) propositions known to be contradictory are not justifiably believable. This paper shows that there is a hybrid of the lottery and preface paradoxes that does not require Sufficiency to arise, but only Conjunction Closure and No Contradictions; and it argues (...) that, given any plausible solution to this paradox, if one is not ready to deny Conjunction Closure (and analogous consistency principles), then one must endorse the thesis that justified believability is factive. (shrink)

We propose a Bayesian framework for the attribution of knowledge, and apply this framework to generate novel predictions about knowledge attribution for different types of “Gettier cases”, in which an agent is led to a justified true belief yet has made erroneous assumptions. We tested these predictions using a paradigm based on semantic integration. We coded the frequencies with which participants falsely recalled the word “thought” as “knew” (or a near synonym), yielding an implicit measure of conceptual activation. Our experiments (...) confirmed the predictions of our Bayesian account of knowledge attribution across three experiments. We found that Gettier cases due to counterfeit objects were not treated as knowledge (Experiment 1), but those due to intentionally-replaced evidence were (Experiment 2). Our findings are not well explained by an alternative account focused only on luck, because accidentally-replaced evidence activated the knowledge concept more strongly than did similar false belief cases (Experiment 3). We observed a consistent pattern of results across a number of different vignettes that varied the quality and type of evidence available to agents, the relative stakes involved, and surface details of content. Accordingly, the present findings establish basic phenomena surrounding people’s knowledge attributions in Gettier cases, and provide explanations of these phenomena within a Bayesian framework. (shrink)

This article sketches a theory of objective probability focusing on nomic probability, which is supposed to be the kind of probability figuring in statistical laws of nature. The theory is based upon a strengthened probability calculus and some epistemological principles that formulate a precise version of the statistical syllogism. It is shown that from this rather minimal basis it is possible to derive theorems comprising (1) a theory of direct inference, and (2) a theory of induction. The theory of induction (...) is not of the familiar Bayesian variety, but consists of a precise version of the traditional Nicod Principle and its statistical analogues. (shrink)

An argument is self-defeating when it contains defeaters for some of its own defeasible lines. It is shown that the obvious rules for defeat among arguments do not handle self-defeating arguments correctly. It turns out that they constitute a pervasive phenomenon that threatens to cripple defeasible reasoning, leading to almost all defeasible reasoning being defeated by unexpected interactions with self-defeating arguments. This leads to some important changes in the general theory of defeasible reasoning.

In concrete applications of probability, statistical investigation gives us knowledge of some probabilities, but we generally want to know many others that are not directly revealed by our data. For instance, we may know prob(P/Q) (the probability of P given Q) and prob(P/R), but what we really want is prob(P/Q& R), and we may not have the data required to assess that directly. The probability calculus is of no help here. Given prob(P/Q) and prob(P/R), it is consistent with the probability (...) calculus for prob(P/Q& R) to have any value between 0 and 1. Is there any way to make a reasonable estimate of the value of prob(P/Q& R) 1 A related problem occurs when probability practitioners adopt undefended assumptions of statistical independence simply on the basis of not seeing any connection between two propositions. This is common practice, but its justification has eluded probability theorists, and researchers are typically apologetic about making such assumptions. Is there any way to defend the practice? This paper shows that on a certain conception of probability—nomic probability—there are principles of "probable probabilities" that license inferences of the above sort. These are principles telling us that although certain inferences from probabilities to probabilities are not deductively valid, nevertheless the second-order probability of their yielding correct results is 1. This makes it defeasibly reasonable to make the inferences. Thus I argue that it is defeasibly reasonable to assume statistical independence when we have no information to the contrary. And I show that there is a function Y(r, s, a) such that if prob(P/Q) = r, prob(P/R) = s, andprob(P/U) = a (where U is our background knowledge) then it is defeasibly reasonable to expect that prob(P/Q&R) = Y(r, s, a). Numerous other defeasible inferences are licensed by similar principles of probable probabilities. This has the potential to greatly enhance the usefulness of probabilities in practical application. (shrink)

Probabilities are important in belief updating, but probabilistic reasoning does not subsume everything else (as the Bayesian would have it). On the contrary, Bayesian reasoning presupposes knowledge that cannot itself be obtained by Bayesian reasoning, making generic Bayesianism an incoherent theory of belief updating. Instead, it is indefinite probabilities that are of principal importance in belief updating. Knowledge of such indefinite probabilities is obtained by some form of statistical induction, and inferences to non-probabilistic conclusions are carried out in accordance with (...) the statistical syllogism. Such inferences have been the focus of much attention in the nonmonotonic reasoning literature, but the logical complexity of such inference has not been adequately appreciated. (shrink)

There was a long tradition in philosophy according to which good reasoning had to be deductively valid. However, that tradition began to be questioned in the 1960’s, and is now thoroughly discredited. What caused its downfall was the recognition that many familiar kinds of reasoning are not deductively valid, but clearly confer justification on their conclusions. Here are some simple examples.

From the dictum "ought implies can", it has been argued that no account of belief's normativity can avoid the unpalatable result that, for unbelievable propositions such as "It is raining and nobody believes that it is raining", one ought not to believe them even if true. In this article, I argue that this move only succeeds on a faulty assumption about the conjunction of doxastic "oughts.".

Dilation occurs when an interval probability estimate of some event E is properly included in the interval probability estimate of E conditional on every event F of some partition, which means that one’s initial estimate of E becomes less precise no matter how an experiment turns out. Critics maintain that dilation is a pathological feature of imprecise probability models, while others have thought the problem is with Bayesian updating. However, two points are often overlooked: (1) knowing that E is stochastically (...) independent of F (for all F in a partition of the underlying state space) is sufficient to avoid dilation, but (2) stochastic independence is not the only independence concept at play within imprecise probability models. In this paper we give a simple characterization of dilation formulated in terms of deviation from stochastic independence, propose a measure of dilation, and distinguish between proper and improper dilation. Through this we revisit the most sensational examples of dilation, which play up independence between dilator and dilatee, and find the sensationalism undermined by either fallacious reasoning with imprecise probabilities or improperly constructed imprecise probability models. (shrink)

We offer a probabilistic model of rational consequence relations (Lehmann and Magidor, 1990) by appealing to the extension of the classical Ramsey-Adams test proposed by Vann McGee in (McGee, 1994). Previous and influential models of nonmonotonic consequence relations have been produced in terms of the dynamics of expectations (Gärdenfors and Makinson, 1994; Gärdenfors, 1993).'Expectation' is a term of art in these models, which should not be confused with the notion of expected utility. The expectations of an agent are some form (...) of belief weaker than absolute certainty. Our model offers a modified and extended version of an account of qualitative belief in terms of conditional probability, first presented in (van Fraassen, 1995). We use this model to relate probabilistic and qualitative models of non-monotonic relations in terms of expectations. In doing so we propose a probabilistic model of the notion of expectation. We provide characterization results both for logically finite languages and for logically infinite, but countable, languages. The latter case shows the relevance of the axiom of countable additivity for our probability functions. We show that a rational logic defined over a logically infinite language can only be fully characterized in terms of finitely additive conditional probability. (shrink)

Given plausible assumptions about the nature of evidence and undercutting defeat, many believe that the force of the evidential problem of evil depends on sceptical theism’s being false: if evil is...

I give a semantics for a logic with two pairs of doxastic modals and an indicative conditional connective that all nest without restriction. Sentences are evaluated as accepted, rejected, or neither. Certainty is the necessity-like modality of acceptance. Inferences may proceed from premises that are certain, or merely accepted, or a mix of both. This semantic setup yields some striking results. Notably, the existence of inferences that preserve certainty but not acceptance very directly implies both failure of modus ponens for (...) the indicative conditional in the logic of acceptance and failure of the deduction theorem for the material conditional in the logic of certainty. The latter failure dissolves, in the logic of certainty, the much - discussed tension between modus ponens and the law of import-export. (shrink)

Jim buys a ticket in a million-ticket lottery. He knows it is a fair lottery, but, given the odds, he believes he will lose. When the winning ticket is chosen, it is not his. Did he know his ticket would lose? It seems that he did not. After all, if he knew his ticket would lose, why would he have bought it? Further, if he knew his ticket would lose, then, given that his ticket is no different in its chances (...) of winning from any other ticket, it seems that by parity of reasoning he should also know that every other ticket would lose. But of course he doesn’t know that; in fact, he knows that not every ticket will lose. (shrink)

In making assertions one takes on commitments to the consistency of what one asserts and to the logical consequences of what one asserts. Although there is no quick link between belief and assertion, the dialectical requirements on assertion feed back into normative constraints on those beliefs that constitute one's evidence. But if we are not certain of many of our beliefs and that uncertainty is modelled in terms of probabilities, then there is at least prima facie incoherence between the normative (...) constraints on belief and the probability-like structure of degrees of belief. I suggest that the norm-governed practice relating to degrees of belief is the evaluation of betting odds. (shrink)

We introduce an expected-value theory of linguistic modality that makes reference to expected utility and a likelihood-based confirmation measure for deontics and epistemics, respectively. The account is a probabilistic semantics for deontics and epistemics, yet it proposes that deontics and epistemics share a common core modal semantics, as in traditional possible-worlds analysis of modality. We argue that this account is not only theoretically advantageous, but also has far-reaching empirical consequences. In particular, we predict modal versions of reasoning fallacies from the (...) heuristics and biases literature. Additionally, we derive the modal semantics in an entirely transparent manner, as it is based on the compositional semantics of Korean modal expressions that are morphosyntactically decomposed into a conditional and an evaluative predicate. (shrink)

We reflect on lessons that the lottery and preface paradoxes provide for the logic of uncertain inference. One of these lessons is the unreliability of the rule of conjunction of conclusions in such contexts, whether the inferences are probabilistic or qualitative; this leads us to an examination of consequence relations without that rule, the study of other rules that may nevertheless be satisfied in its absence, and a partial rehabilitation of conjunction as a ‘lossy’ rule. A second lesson is the (...) possibility of rational inconsistent belief; this leads us to formulate criteria for deciding when an inconsistent set of beliefs may reasonably be retained. (shrink)

The linguistic and cognitive sciences have severely underestimated the degree of linguistic diversity in the world. Part of the reason for this is that we have projected assumptions based on English and familiar languages onto the rest. We focus on some distortions this has introduced, especially in the study of semantics.

It is natural to think of precise probabilities as being special cases of imprecise probabilities, the special case being when one’s lower and upper probabilities are equal. I argue, however, that it is better to think of the two models as representing two different aspects of our credences, which are often vague to some degree. I show that by combining the two models into one model, and understanding that model as a model of vague credence, a natural interpretation arises that (...) suggests a hypothesis concerning how we can improve the accuracy of aggregate credences. I present empirical results in support of this hypothesis. I also discuss how this modeling interpretation of imprecise probabilities bears upon a philosophical objection that has been raised against them, the so-called inductive learning problem. (shrink)

There is the idea that rational belief for a single individual can be constructed via a process of unilateral argument. To preempt antipathy between the AI communities that can claim the idea that rational belief can be so constructed, we trace the idea to the beginning of this century, to Keynes' dispute with Russell over logic and probability. We review how Keynesian ideas were revived in AI's work on non-monotonic reasoning and parallel developments in philosophical logic.

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 paper concerns the extent to which uncertain propositional reasoning can track probabilistic reasoning, and addresses kinematic problems that extend the familiar Lottery paradox. An acceptance rule assigns to each Bayesian credal state p a propositional belief revision method B p , which specifies an initial belief state B p (T) that is revised to the new propositional belief state B(E) upon receipt of information E. An acceptance rule tracks Bayesian conditioning when B p (E) = B p|E (T), for (...) every E such that p(E) > 0; namely, when acceptance by propositional belief revision equals Bayesian conditioning followed by acceptance. Standard proposals for uncertain acceptance and belief revision do not track Bayesian conditioning. The "Lockean" rule that accepts propositions above a probability threshold is subject to the familiar lottery paradox (Kyburg 1961), and we show that it is also subject to new and more stubborn paradoxes when the tracking property is taken into account. Moreover, we show that the familiar AGM approach to belief revision (Harper, Synthese 30(1-2):221-262, 1975; Alchourrón et al., J Symb Log 50:510-530, 1985) cannot be realized in a sensible way by any uncertain acceptance rule that tracks Bayesian conditioning. Finally, we present a plausible, alternative approach that tracks Bayesian conditioning and avoids all of the paradoxes. It combines an odds-based acceptance rule proposed originally by Levi (1996) with a non-AGM belief revision method proposed originally by Shoham (1987). (shrink)

“Since today is Saturday, the grocery store is open today and will be closed tomorrow; so let’s go today”. That is an example of everyday practical reasoning—reasoning directly with the propositions that one believes but may not be fully certain of. Everyday practical reasoning is one of our most familiar kinds of decisions but, unfortunately, some foundational questions about it are largely ignored in the standard decision theory: (Q1) What are the decision rules in everyday practical reasoning that connect qualitative (...) belief and desire to preference over acts? (Q2) What sort of logic should govern qualitative beliefs in everyday practical reasoning, and to what extent is that logic necessary for the purposes of qualitative decisions? (Q3) What kinds of qualitative decisions are always representable as results of everyday practical reasoning? (Q4) Under what circumstances do the results of everyday practical reasoning agree with the Bayesian ideal of expected utility maximization? This paper proposes a rigorous decision theory for answering all of those questions, which is developed in parallel to Savage’s (1954) foundation of expected utility maximization. In light of a new representation result, everyday practical reasoning provides a sound and complete method for a very wide class of qualitative decisions; and, to that end, qualitative beliefs must be allowed to be closed under classical logic plus a well-known nonmonotonic logic—the so-called system ℙ. (shrink)