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)

This paper explores the space of (propositional) probabilistic logical languages, ranging from a purely `qualitative' comparative language to a highly `quantitative' language involving arbitrary polynomials over probability terms. While talk of qualitative vs. quantitative may be suggestive, we identify a robust and meaningful boundary in the space by distinguishing systems that encode (at most) additive reasoning from those that encode additive and multiplicative reasoning. The latter includes not only languages with explicit multiplication but also languages expressing notions of dependence and (...) conditionality. We show that the distinction tracks a divide in computational complexity: additive systems remain complete for NP, while multiplicative systems are robustly complete for ∃ℝ. We also address axiomatic questions, offering several new completeness results as well as a proof of non-finite-axiomatizability for comparative probability. Repercussions of our results for conceptual and empirical questions are addressed, and open problems are discussed. (shrink)

This paper is a discussion note on Isaacs et al. (2022), who have claimed to offer a new motivation for imprecise probabilities, based on the mathematical phenomenon of non-measurability. In this note, I clarify some consequences of their proposal. In particular, I show that if their proposal is applied to a bounded 3-dimensional space, then they have to reject at least one of the following: (i) If A is at most as probable as B and B is at most as (...) probable as C, then A is at most as probable as C. (ii) Let A ∩ C = B ∩ C = ∅. A is at most as probable as B iff (A ∪ C) is at most as probable as (B ∪ C). But rejecting either statement seems unattractive. (shrink)

How do we ascribe subjective probability? In decision theory, this question is often addressed by representation theorems, going back to Ramsey (1926), which tell us how to define or measure subjective probability by observable preferences. However, standard representation theorems make strong rationality assumptions, in particular expected utility maximization. How do we ascribe subjective probability to agents which do not satisfy these strong rationality assumptions? I present a representation theorem with weak rationality assumptions which can be used to define or measure (...) subjective probability for partly irrational agents. (shrink)

In his classic book “the Foundations of Statistics” Savage developed a formal system of rational decision making. The system is based on (i) a set of possible states of the world, (ii) a set of consequences, (iii) a set of acts, which are functions from states to consequences, and (iv) a preference relation over the acts, which represents the preferences of an idealized rational agent. The goal and the culmination of the enterprise is a representation theorem: Any preference relation that (...) satisfies certain arguably acceptable postulates determines a (finitely additive) probability distribution over the states and a utility assignment to the consequences, such that the preferences among acts are determined by their expected utilities. Additional problematic assumptions are however required in Savage's proofs. First, there is a Boolean algebra of events (sets of states) which determines the richness of the set of acts. The probabilities are assigned to members of this algebra. Savage's proof requires that this be a σ-algebra (i.e., closed under infinite countable unions and intersections), which makes for an extremely rich preference relation. On Savage's view we should not require subjective probabilities to be σ-additive. He therefore finds the insistence on a σ-algebra peculiar and is unhappy with it. But he sees no way of avoiding it. Second, the assignment of utilities requires the constant act assumption: for every consequence there is a constant act, which produces that consequence in every state. This assumption is known to be highly counterintuitive. The present work contains two mathematical results. The first, and the more difficult one, shows that the σ-algebra assumption can be dropped. The second states that, as long as utilities are assigned to finite gambles only, the constant act assumption can be replaced by the more plausible and much weaker assumption that there are at least two non-equivalent constant acts. The second result also employs a novel way of deriving utilities in Savage-style systems -- without appealing to von Neumann-Morgenstern lotteries. The paper discusses the notion of “idealized agent" that underlies Savage's approach, and argues that the simplified system, which is adequate for all the actual purposes for which the system is designed, involves a more realistic notion of an idealized agent. (shrink)

According to comparativism, degrees of belief are reducible to a system of purely ordinal comparisons of relative confidence. (For example, being more confident that P than that Q, or being equally confident that P and that Q.) In this paper, I raise several general challenges for comparativism, relating to (i) its capacity to illuminate apparently meaningful claims regarding intervals and ratios of strengths of belief, (ii) its capacity to draw enough intuitively meaningful and theoretically relevant distinctions between doxastic states, and (...) (iii) its capacity to handle common instances of irrationality. (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)

In this paper, we explore semantics for comparative epistemic modals that avoid the entailment problems shown to result from Kratzer’s (1991) semantics by Yalcin (2006, 2009, 2010). In contrast to the alternative semantics presented by Yalcin and Lassiter (2010, 2011), based on finitely additive probability measures, we introduce semantics based on qualitatively additive measures, as well as semantics based on purely qualitative orderings, including orderings on propositions derived from orderings on worlds in the tradition of Kratzer (1991). All of these (...) semantics avoid the entailment problems that result from Kratzer’s semantics. Our discussion focuses on methodological issues concerning the choice between different semantics. (shrink)

It is a consequence of the theory of imprecise credences that there exist situations in which rational agents inevitably become less opinionated toward some propositions as they gather more evidence. The fact that an agent's imprecise credal state can dilate in this way is often treated as a strike against the imprecise approach to inductive inference. Here, we show that dilation is not a mere artifact of this approach by demonstrating that opinion loss is countenanced as rational by a substantially (...) broader class of normative theories than has been previously recognised. Specifically, we show that dilation-like phenomena arise even when one abandons the basic assumption that agents have (precise or imprecise) credences of any kind, and follows directly from bedrock norms for rational comparative confidence judgements of the form `I am at least as confident in p as I am in q'. We then use the comparative confidence framework to develop a novel understanding of what exactly gives rise to dilation-like phenomena. By considering opinion loss in this more general setting, we are able to provide a novel assessment of the prospects for an account of inductive inference that is not saddled with the inevitability of rational opinion loss. (shrink)

Single-case and long-run propensity theories are among the main objective interpretations of probability. There have been various objections to these theories, e.g. that it is difficult to explain why propensities should satisfy the probability axioms and, worse, that propensities are at odds with these axioms, that the explication of propensities is circular and accordingly not informative, and that single-case propensities are metaphysical and accordingly non-scientific. We consider various propensity theories of probability and their prospects in light of these objections. We (...) argue that while propensity theories face challenges, these challenges do not undermine their validity as prospective interpretations of probability in science. (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)

This paper examines the preference-based approach to the identification of beliefs. It focuses on the main problem to which this approach is exposed, namely that of state-dependent utility. First, the problem is illustrated in full detail. Four types of state-dependent utility issues are distinguished. Second, a comprehensive strategy for identifying beliefs under state-dependent utility is presented and discussed. For the problem to be solved following this strategy, however, preferences need to extend beyond choices. We claim that this a necessary feature (...) of any complete solution to the problem of state-dependent utility. We also argue that this is the main conceptual lesson to draw from it. We show that this lesson is of interest to both economists and philosophers. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...) propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. Elohim develops a novel, topic-sensitive truthmaker semantics for dynamic epistemic logic, and develops a novel, dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for two-dimensional (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} is availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between Elohim's hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. Elohim countenances a hyperintensional semantics for novel epistemic abstractionist modalities. Elohim suggests, too, that higher observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for two-dimensional hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. Elohim invents a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Elohim provides a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

A probability function is non-conglomerable just in case there is some proposition E and partition \ of the space of possible outcomes such that the probability of E conditional on any member of \ is bounded by two values yet the unconditional probability of E is not bounded by those values. The paradox of non-conglomerability is the counterintuitive—and controversial—claim that a rational agent’s subjective probability function can be non-conglomerable. In this paper, I present a qualitative analogue of the paradox. I (...) show that, under antecedently plausible assumptions, an analogue of the paradox arises for rational comparative confidence. As I show, the qualitative paradox raises its own distinctive set of philosophical issues. (shrink)

This paper addresses the issue of finite versus countable additivity in Bayesian probability and decision theory -- in particular, Savage's theory of subjective expected utility and personal probability. I show that Savage's reason for not requiring countable additivity in his theory is inconclusive. The assessment leads to an analysis of various highly idealised assumptions commonly adopted in Bayesian theory, where I argue that a healthy dose of, what I call, conceptual realism is often helpful in understanding the interpretational value of (...) sophisticated mathematical structures employed in applied sciences like decision theory. In the last part, I introduce countable additivity into Savage's theory and explore some technical properties in relation to other axioms of the system. (shrink)

We apply the recently elaborated notions of 'pragmatic truth' and 'pragmatic probability' to the problem of the construction of a logic of inductive inference. It is argued that the system outlined here is able to overcome many of the objections usually levelled against such attempts. We claim, furthermore, that our view captures the essentially cumulative nature of science and allows us to explain why it is indeed reasonable to accept and believe in the conclusions reached by inductive inference.

Imprecise probabilities are often modelled with representors, or sets of probability functions. In the recent literature, two ways of interpreting representors have emerged as especially prominent: vagueness interpretations, according to which each probability function in the set represents how the agent's beliefs would be if any vagueness were precisified away; and comparativist interpretations, according to which the set represents those comparative confidence relations that are common to all probability functions therein. I argue that these interpretations have some important limitations. I (...) also propose an alternative—the functional interpretation—according to which representors are best interpreted by reference to the roles they play in the theories that make use of them. (shrink)

According to the traditional Bayesian view of credence, its structure is that of precise probability, its objects are descriptive propositions about the empirical world, and its dynamics are given by conditionalization. Each of the three essays that make up this thesis deals with a different variation on this traditional picture. The first variation replaces precise probability with sets of probabilities. The resulting imprecise Bayesianism is sometimes motivated on the grounds that our beliefs should not be more precise than the evidence (...) calls for. One known problem for this evidentially motivated imprecise view is that in certain cases, our imprecise credence in a particular proposition will remain the same no matter how much evidence we receive. In the first essay I argue that the problem is much more general than has been appreciated so far, and that it’s difficult to avoid without compromising the initial evidentialist motivation. The second variation replaces descriptive claims with moral claims as the objects of credence. I consider three standard arguments for probabilism with respect to descriptive uncertainty—representation theorem arguments, Dutch book arguments, and accuracy arguments—in order to examine whether such arguments can also be used to establish probabilism with respect to moral uncertainty. In the second essay, I argue that by and large they can, with some caveats. First, I don’t examine whether these arguments can be given sound non-cognitivist readings, and any conclusions therefore only hold conditional on cognitivism. Second, decision-theoretic representation theorems are found to be less convincing in the moral case, because there they implausibly commit us to thinking that intertheoretic comparisons of value are always possible. Third and finally, certain considerations may lead one to think that imprecise probabilism provides a more plausible model of moral epistemology. The third variation considers whether, in addition to conditionalization, agents may also change their minds by becoming aware of propositions they had not previously entertained, and therefore not previously assigned any probability. More specifically, I argue that if we wish to make room for reflective equilibrium in a probabilistic moral epistemology, we must allow for awareness growth. In the third essay, I sketch the outline of such a Bayesian account of reflective equilibrium. Given that this account gives a central place to awareness growth, and that the rationality constraints on belief change by awareness growth are much weaker than those on belief change by conditionalization, it follows that the rationality constraints on the credences of agents who are seeking reflective equilibrium are correspondingly weaker. (shrink)

As an application of his Material Theory of Induction, Norton (2018; manuscript) argues that the correct inductive logic for a fair infinite lottery, and also for evaluating eternal inflation multiverse models, is radically different from standard probability theory. This is due to a requirement of label independence. It follows, Norton argues, that finite additivity fails, and any two sets of outcomes with the same cardinality and co-cardinality have the same chance. This makes the logic useless for evaluating multiverse models based (...) on self-locating chances, so Norton claims that we should despair of such attempts. However, his negative results depend on a certain reification of chance, consisting in the treatment of inductive support as the value of a function, a value not itself affected by relabeling. Here we define a purely comparative infinite lottery logic, where there are no primitive chances but only a relation of ‘at most as likely’ and its derivatives. This logic satisfies both label independence and a comparative version of additivity as well as several other desirable properties, and it draws finer distinctions between events than Norton's. Consequently, it yields better advice about choosing between sets of lottery tickets than Norton's, but it does not appear to be any more helpful for evaluating multiverse models. Hence, the limitations of Norton's logic are not entirely due to the failure of additivity, nor to the fact that all infinite, co-infinite sets of outcomes have the same chance, but to a more fundamental problem: We have no well-motivated way of comparing disjoint countably infinite sets. (shrink)

Intervals in boolean algebras enter into the study of conditional assertions (or events) in two ways: directly, either from intuitive arguments or from Goodman, Nguyen and Walker's representation theorem, as suitable mathematical entities to bear conditional probabilities, or indirectly, via a representation theorem for the family of algebras associated with de Finetti's three-valued logic of conditional assertions/events. Further representation theorems forge a connection with rough sets. The representation theorems and an equivalent of the boolean prime ideal theorem yield an algebraic (...) completeness theorem for the three-valued logic. This in turn leads to a Henkin-style completeness theorem. Adequacy with respect to a family of Kripke models for de Finetti's logic, Łukasiewicz's three-valued logic and Priest's Logic of Paradox is demonstrated. The extension to first-order yields a short proof of adequacy for Körner's logic of inexact predicates. (shrink)

Rational agents seem more confident in any possible event than in an impossible event. But if rational credences are real-valued, then there are some possible events that are assigned 0 credence nonetheless. How do we differentiate these events from impossible events then when we order events? de Finetti (1975), Hájek (2012) and Easwaran (2014) suggest that when ordering events, conditional credences and subset relations are as relevant as unconditional credences. I present a counterexample to all their proposals in this paper. (...) While their proposals order possible and impossible events correctly, they deliver the wrong verdict for disjoint possible events assigned equal positive credence. (shrink)

Why is it good to be less, rather than more incoherent? Julia Staffel, in her excellent book “Unsettled Thoughts,” answers this question by showing that if your credences are incoherent, then there is some way of nudging them toward coherence that is guaranteed to make them more accurate and reduce the extent to which they are Dutch-bookable. This seems to show that such a nudge toward coherence makes them better fit to play their key epistemic and practical roles: representing the (...) world and guiding action. In this paper, I argue that Staffel’s strategy needs a small tweak. While she identifies appropriate measures of epistemic value, she does not identify appropriate measures of practical value. Staffel measures practical value using Dutchbookability scores. But credences have practical value in virtue of recommending actions that produce as much utility as possible. And while susceptibility to a Dutch book is a surefire sign that one’s credences are needlessly bad at this task, one’s degree of Dutch-bookability is not itself a good measure of how well they recommend practically valuable actions. Strictly proper scoring rules, I argue, are the right tools for measuring both epistemic and practical value. I show that we can rerun Staffel’s strategy swapping in strictly proper scoring rules for Dutch-bookability measures. So long as one’s epistemic scoring rule and practical scoring rule are “sufficiently similar,” there is some way of nudging incoherent credences toward coherence that is guaranteed to yield more of both types of value. (shrink)

Some propositions add more information to bodies of propositions than do others. We start with intuitive considerations on qualitative comparisons of information added . Central to these are considerations bearing on conjunctions and on negations. We find that we can discern two distinct, incompatible, notions of information added. From the comparative notions we pass to quantitative measurement of information added. In this we borrow heavily from the literature on quantitative representations of qualitative, comparative conditional probability. We look at two ways (...) to obtain a quantitative conception of information added. One, the most direct, mirrors Bernard Koopman’s construction of conditional probability: by making a strong structural assumption, it leads to a measure that is, transparently, some function of a function P which is, formally, an assignment of conditional probability (in fact, a Popper function). P reverses the information added order and mislocates the natural zero of the scale so some transformation of this scale is needed but the derivation of P falls out so readily that no particular transformation suggests itself. The Cox–Good–Aczél method assumes the existence of a quantitative measure matching the qualitative relation, and builds on the structural constraints to obtain a measure of information that can be rescaled as, formally, an assignment of conditional probability. A classical result of Cantor’s, subsequently strengthened by Debreu, goes some way towards justifying the assumption of the existence of a quantitative scale. What the two approaches give us is a pointer towards a novel interpretation of probability as a rescaling of a measure of information added. (shrink)

This essay aims to provide a modal logic for rational intuition. Similarly to treatments of the property of knowledge in epistemic logic, I argue that rational intuition can be codified by a modal operator governed by the modal $\mu$-calculus. Via correspondence results between fixed point modal propositional logic and the bisimulation-invariant fragment of monadic second-order logic, a precise translation can then be provided between the notion of 'intuition-of', i.e., the cognitive phenomenal properties of thoughts, and the modal operators regimenting the (...) notion of 'intuition-that'. I argue that intuition-that can further be shown to entrain conceptual elucidation, by way of figuring as a dynamic-interpretational modality which induces the reinterpretation of both domains of quantification and the intensions and hyperintensions of mathematical concepts that are formalizable in monadic first- and second-order formal languages. Hyperintensionality is countenanced via a topic-sensitive epistemic two-dimensional truthmaker semantics. (shrink)

Recent years have witnessed a proliferation of attempts to apply the mathematical theory of probability to the semantics of natural language probability talk. These sorts of “probabilistic” semantics are often motivated by their ability to explain intuitions about inferences involving “likely” and “probably”—intuitions that Angelika Kratzer’s canonical semantics fails to accommodate through a semantics based solely on an ordering of worlds and a qualitative ranking of propositions. However, recent work by Wesley Holliday and Thomas Icard has been widely thought to (...) undercut this motivation: they present a world-ordering semantics that yields essentially the same logic as probabilistic semantics. In this paper, I argue that the challenge remains: defenders of world-ordering semantics have yet to offer a plausible semantics that captures the logic of comparative likelihood. Holliday & Icard’s semantics yields an adequate logic only if models are restricted to Noetherian pre-orders. But I argue that the Noetherian restriction faces problems in cases involving infinitely large domains of epistemic possibilities. As a result, probabilistic semantics remains the better explanation of the data. (shrink)

This paper examines the interaction between the philosophy and psychology of concepts and the modal characterization of the deductive concept of logical validity. The concept of logical consequence on which I focus is model-theoretic, where the concept records the property of necessary truth-preservation from the premise of an argument to its conclusion, as well as the condition that, in the class of all possible worlds in which a premise is true, a consequent formula or succedent class of formulas is true, (...) as well. Focusing on the case of logical necessity, I argue that the ability to account for the modal properties of concepts places a desideratum on the explanatory adequacy of theories of mental representation. I outline, then, five approaches to the nature of concepts pursued in philosophy and cognitive science, and argue that the above desideratum does not appear to be satisfiable by the candidate proposals. Given the limits of the foregoing, I appeal to a sixth approach -- namely, cognitivism about epistemic modality, according to which epistemic intensions are semantically imbued functions in the language of thought -- and endeavor to demonstrate how the proposal can sufficiently account for the modal profile of the concept of logical consequence. (shrink)

My dissertation explores the ways in which Rudolf Carnap sought to make philosophy scientific by further developing recent interpretive efforts to explain Carnap’s mature philosophical work as a form of engineering. It does this by looking in detail at his philosophical practice in his most sustained mature project, his work on pure and applied inductive logic. I, first, specify the sort of engineering Carnap is engaged in as involving an engineering design problem and then draw out the complications of design (...) problems from current work in history of engineering and technology studies. I then model Carnap’s practice based on those lessons and uncover ways in which Carnap’s technical work in inductive logic takes some of these lessons on board. This shows ways in which Carnap’s philosophical project subtly changes right through his late work on induction, providing an important corrective to interpretations that ignore the work on inductive logic. Specifically, I show that paying attention to the historical details of Carnap’s attempt to apply his work in inductive logic to decision theory and theoretical statistics in the 1950s and 1960s helps us understand how Carnap develops and rearticulates the philosophical point of the practical/theoretical distinction in his late work, offering thus a new interpretation of Carnap’s technical work within the broader context of philosophy of science and analytical philosophy in general. (shrink)

Any dynamic decision model should be based on conditional objects and must refer to (not necessarily structured) domains containing only the elements and the information of interest. We characterize binary relations, defined on an arbitrary set of conditional events, which are representable by a coherent generalized decomposable conditional measure and we study, in particular, the case of binary relations representable by a coherent conditional probability.

In the insurance literature, it is often argued that private markets can provide insurance against ‘risks’ but not against ‘uncertainties’ in the sense of Knight ([1921]) or Keynes ([1921]). This claim is at odds with the standard economic model of risk exchange which, in assuming that decision-makers are always guided by point-valued subjective probabilities, predicts that all uncertainties can, in theory, be insured. Supporters of the standard model argue that the insuring of highly idiosyncratic risks by Lloyd's of London proves (...) that this is so even in practice. The purpose of this article is to show that Bruno de Finetti, famous as one of the three founding fathers of the subjective approach to probability assumed by the standard model, actually made a theoretical case for uncertainty within the subjectivist approach. We draw on empirical evidence from the practice of underwriters to show how this case may help explain the reluctance of insurers to cover highly uncertain contingencies. (shrink)

Evidence Theory is a branch of mathematics that concerns combination of empirical evidence in an individual’s mind in order to construct a coherent picture of reality. Designed to deal with unexpected empirical evidence suggesting new possibilities, evidence theory is compatible with Shackle’s idea of decision-making as a creative act. This essay investigates this connection in detail, pointing to the usefulness of evidence theory to formalise and extend Shackle’s decision theory. In order to ease a proper framing of the issues involved, (...) evidence theory is compared with sub-additive probability theory and Ewens’s infinite alleles model. Furthermore, the original version of evidence theory is presented along with its most recent developments. (shrink)

Of late, probability subjectivism was resuscitated by the development of statistical decision theory. In the decision model, which is briefly described in the paper, the knowledge of a probability distribution over the states of nature plays a decisive role. What sources of probability knowledge are legitimate, or at all possible, is the main point at issue. Different definitions, evaluations, and foundations of probability are narrated, discussed, and weighed against each other. The typical research strategy of the statistician is set against (...) axiomatics of subjective or mathematical probability. Finally, the epistemological roots of the probability concept are located by the author in what he calls the “etiality principle”. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...) propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. Elohim develops a novel, topic-sensitive truthmaker semantics for dynamic epistemic logic, and develops a novel, dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for two-dimensional (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} is availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between Elohim's hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. Elohim countenances a hyperintensional semantics for novel epistemic abstractionist modalities. Elohim suggests, too, that higher observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for two-dimensional hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. Elohim invents a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Elohim provides a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

Uncertainty and vagueness/imprecision are not the same: one can be certain about events described using vague predicates and about imprecisely specified events, just as one can be uncertain about precisely specified events. Exactly because of this, a question arises about how one ought to assign probabilities to imprecisely specified events in the case when no possible available evidence will eradicate the imprecision (because, say, of the limits of accuracy of a measuring device). Modelling imprecision by rough sets over an approximation (...) space presents an especially tractable case to help get one’s bearings. Two solutions present themselves: the first takes as upper and lower probabilities of the event X the (exact) probabilities assigned X ’s upper and lower rough-set approximations; the second, motivated both by formal considerations and by a simple betting argument, is to treat X ’s rough-set approximation as a conditional event and assign to it a point-valued (conditional) probability. (shrink)

My dissertation is about Bayesian rationality for non-ideal agents. I show how to derive subjective probabilities from preferences using much weaker rationality assumptions than other standard representation theorems. I argue that non-ideal agents might be uncertain about how they will update on new information and consider two consequences of this uncertainty: such agents should sometimes reject free information and make choices which, taken together, yield sure loss. The upshot is that Bayesian rationality for non-ideal agents makes very different normative demands (...) than ideal Bayesian rationality. (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)

The generalized Bayes’ rule (GBR) can be used to conduct ‘quasi-Bayesian’ analyses when prior beliefs are represented by imprecise probability models. We describe a procedure for deriving coherent imprecise probability models when the event space consists of a finite set of mutually exclusive and exhaustive events. The procedure is based on Walley’s theory of upper and lower prevision and employs simple linear programming models. We then describe how these models can be updated using Cozman’s linear programming formulation of the GBR. (...) Examples are provided to demonstrate how the GBR can be applied in practice. These examples also illustrate the effects of prior imprecision and prior-data conflict on the precision of the posterior probability distribution. (shrink)

There is a growing interest in the foundations as well as the application of imprecise probability in contemporary epistemology. This dissertation is concerned with the application. In particular, the research presented concerns ways in which imprecise probability, i.e. sets of probability measures, may helpfully address certain philosophical problems pertaining to rational belief. The issues I consider are disagreement among epistemic peers, complete ignorance, and inductive reasoning with imprecise priors. For each of these topics, it is assumed that belief can be (...) modeled with imprecise probability, and thus there is a non-classical solution to be given to each problem. I argue that this is the case for peer disagreement and complete ignorance. However, I discovered that the approach has its shortcomings, too, specifically in regard to inductive reasoning with imprecise priors. Nevertheless, the dissertation ultimately illustrates that imprecise probability as a model of rational belief has a lot of promise, but one should be aware of its limitations also. (shrink)