Branden Fitelson

Lewis' (1976) triviality argument against The Equation (also known as Adams' thesis) rests on a strong assumption about the nature of (epistemic) rational requirements. Interestingly, Lewis (1980) later rejected this assumption. In his discussion of the Principal Principle, Lewis makes a weaker assumption about the nature of rational requirements. In this paper, I explain how to apply the insights of Lewis (1980) to reply to Lewis (1976). This leads to a more reasonable rendition of the equation -- one that is (a) immune to triviality and (b) a better candidate for a (bona fide) rational requirement. Further issues and problems with Adams' thesis (raised by more recent work on indicative conditionals) are also discussed.

In this paper, the authors describe their initial investigations in computational metaphysics. Our method is to implement axiomatic metaphysics in an automated reasoning system. In this paper, we describe what we have discovered when the theory of abstract objects is implemented in PROVER9 (a first-order automated reasoning system which is the successor to OTTER). After reviewing the second-order, axiomatic theory of abstract objects, we show (1) how to represent a fragment of that theory in PROVER9's first-order syntax, and (2) how PROVER9 then finds proofs of interesting theorems of metaphysics, such as that every possible world is maximal. We conclude the paper by discussing some issues for further research.

There are many things—call them ‘experts’—that you should defer to in forming your opinions. The trouble is, many experts are modest: they’re less than certain that they are worthy of deference. When this happens, the standard theories of deference break down: the most popular (“Reflection”-style) principles collapse to inconsistency, while their most popular (“New-Reflection”-style) variants allow you to defer to someone while regarding them as an anti-expert. We propose a middle way: deferring to someone involves preferring to make any decision using their opinions instead of your own. In a slogan, deferring opinions is deferring decisions. Generalizing the proposal of Dorst (2020a), we first formulate a new principle that shows exactly how your opinions must relate to an expert’s for this to be so. We then build off the results of Levinstein (2019) and Campbell-Moore (2020) to show that this principle is also equivalent to the constraint that you must always expect the expert’s estimates to be more accurate than your own. Finally, we characterize the conditions an expert’s opinions must meet to be worthy of deference in this sense, showing how they sit naturally between the too-strong constraints of Reflection and the too-weak constraints of New Reflection.

According to Bayesian confirmation theory, evidence E (incrementally) confirms (or supports) a hypothesis H (roughly) just in case E and H are positively probabilistically correlated (under an appropriate probability function Pr). There are many logically equivalent ways of saying that E and H are correlated under Pr. Surprisingly, this leads to a plethora of non-equivalent quantitative measures of the degree to which E confirms H (under Pr). In fact, many non-equivalent Bayesian measures of the degree to which E confirms (or supports) H have been proposed and defended in the literature on inductive logic. I provide a thorough historical survey of the various proposals, and a detailed discussion of the philosophical ramifications of the differences between them. I argue that the set of candidate measures can be narrowed drastically by just a few intuitive and simple desiderata. In the end, I provide some novel and compelling reasons to think that the correct measure of degree of evidential support (within a Bayesian framework) is the (log) likelihood ratio. The central analyses of this research have had some useful and interesting byproducts, including: (i ) a new Bayesian account of (confirmationally) independent evidence, which has applications to several important problems in con- firmation theory, including the problem of the (confirmational) value of evidential diversity, and (ii ) novel resolutions of several problems in Bayesian confirmation theory, motivated by the use of the (log) likelihood ratio measure, including a reply to the Popper-Miller critique of probabilistic induction, and a new analysis and resolution of the problem of irrelevant conjunction (a.k.a., the tacking problem).

This (brief) note is about the (evidential) “favoring” relation. Pre-theoretically, favoring is a three-place (epistemic) relation, between an evidential proposition E and two hypotheses H1 and H2. Favoring relations are expressed via locutions of the form: E favors H1 over H2. Strictly speaking, favoring should really be thought of as a four-place relation, between E, H1, H2, and a corpus of background evidence K. But, for present purposes (which won't address issues involving K), I will suppress the background corpus, so as to simplify our discussion. Moreover, the favoring relation is meant to be a propositional epistemic relation, as opposed to a doxastic epistemic relation. That is, the favoring relation is not meant to be restricted to bodies of evidence that are possessed (as evidence) by some actual agent(s), or to hypotheses that are (in fact) entertained by some actual agent(s). In this sense, favoring is analogous to the relation of propositional justification — as opposed to doxastic justification (Conee 1980). In order to facilitate a comparison of Likelihoodist vs Bayesian explications of favoring, I will presuppose the following bridge principle, linking favoring and evidential support: • E favors H1 over H2 iff E supports H1 more strongly than E supports H2.1 Finally, I will only be discussing instances of the favoring relation involving contingent, empirical claims. So, it is to be understood that “favoring” will not apply if any of E, H1, or H2 are non-contingent (and/or non-empirical). With this background in place, we're ready to begin

Suppositions can be introduced in either the indicative or subjunctive mood. The introduction of either type of supposition initiates judgments that may be either qualitative, binary judgments about whether a given proposition is acceptable or quantitative, numerical ones about how acceptable it is. As such, accounts of qualitative/quantitative judgment under indicative/subjunctive supposition have been developed in the literature. We explore these four different types of theories by systematically explicating the relationships canonical representatives of each. Our representative qualitative accounts of indicative and subjunctive supposition are based on the belief change operations provided by AGM revision and KM update respectively; our representative quantitative ones are offered by conditionalization and imaging. This choice is motivated by the familiar approach of understanding supposition as `provisional belief revision' wherein one temporarily treats the supposition as true and forms judgments by making appropriate changes to their other opinions. To compare the numerical judgments recommended by the quantitative theories with the binary ones recommended by the qualitative accounts, we rely on a suitably adapted version of the Lockean thesis. Ultimately, we establish a number of new results that we interpret as vindicating the often-repeated claim that conditionalization is a probabilistic version of revision, while imaging is a probabilistic version of update.

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.