Richard Pettigrew

Beliefs come in different strengths. What are the norms that govern these strengths of belief? Let an agent's belief function at a particular time be the function that assigns, to each of the propositions about which she has an opinion, the strength of her belief in that proposition at that time. Traditionally, philosophers have claimed that an agent's belief function at any time ought to be a probability function (Probabilism), and that she ought to update her belief function upon obtaining new evidence by conditionalizing on that evidence (Conditionalization). Until recently, the central arguments for these claims have been pragmatic. But these putative justifications fail to identify what is epistemically irrational about violating Probabilism or Conditionalization. A new approach, which I will call epistemic utility theory, attempts to remedy this. It treats beliefs as epistemic acts; and it appeals to the notion of an epistemic utility function, which measures of how epistemically valuable a particular belief function is for a particular way the world might be. It then formulates fundamental epistemic norms that are analogous to the fundamental practical norms that underlie decision theory. I survey the results obtained so far in this young research project, and present a sustained critique of certain assumptions that have been made by a number of philosophers working in this area.

Questions about the relation between identity and discernibility are important both in philosophy and in model theory. We show how a philosophical question about identity and dis- cernibility can be ‘factorized’ into a philosophical question about the adequacy of a formal language to the description of the world, and a mathematical question about discernibility in this language. We provide formal definitions of various notions of discernibility and offer a complete classification of their logical relations. Some new and surprising facts are proved; for instance, that weak dis- cernibility corresponds to discernibility in a language with constants for every object, and that weak discernibility is the most discerning nontrivial discernibility relation.

If numbers were identified with any of their standard set-theoretic realizations, then they would have various non-arithmetical properties that mathematicians are reluctant to ascribe to them. Dedekind and later structuralists conclude that we should refrain from ascribing to numbers such ‘foreign’ properties. We first rehearse why it is hard to provide an acceptable formulation of this conclusion. Then we investigate some forms of abstraction meant to purge mathematical objects of all ‘foreign’ properties. One form is inspired by Frege; the other by Dedekind. We argue that both face problems.

Probabilism says an agent is rational only if her credences are probabilistic. This paper is concerned with the so-called Accuracy Dominance Argument for Probabilism. This argument begins with the claim that the sole fundamental source of epistemic value for a credence is its accuracy. It then shows that, however we measure accuracy, any non-probabilistic credences are accuracy-dominated: that is, there are alternative credences that are guaranteed to be more accurate than them. It follows that non-probabilistic credences are irrational. In this paper, I identify and explore a lacuna in this argument. I grant that, if the only doxastic attitudes are credal attitudes, the argument succeeds. But many philosophers say that, alongside credences, there are other doxastic attitudes, such as full beliefs. What's more, those philosophers typically claim, these other doxastic attitudes are closely connected to credences, either as a matter of necessity or normatively. Now, since full beliefs are also doxastic attitudes, it seems that, like credences, the sole source of epistemic value for them is their accuracy. Thus, if we wish to measure the epistemic value of an agent's total doxastic state, we must include not only the accuracy of her credences, but also the accuracy of her full beliefs. However, if this is the case, there is a problem for the Accuracy Dominance Argument for Probabilism. For all the argument says, there might be non-probabilistic credences such that there is no total doxastic state that accuracy-dominates the total doxastic state to which those credences belong

I offer a new interpretation of Aristotle's philosophy of geometry, which he presents in greatest detail in Metaphysics M 3. On my interpretation, Aristotle holds that the points, lines, planes, and solids of geometry belong to the sensible realm, but not in a straightforward way. Rather, by considering Aristotle's second attempt to solve Zeno's Runner Paradox in Book VIII of the Physics , I explain how such objects exist in the sensibles in a special way. I conclude by considering the passages that lead Jonathan Lear to his fictionalist reading of Met . M3,1 and I argue that Aristotle is here describing useful heuristics for the teaching of geometry; he is not pronouncing on the meaning of mathematical talk.

Consider Phoebe and Daphne. Phoebe has credences in 1 million propositions. Daphne, on the other hand, has credences in all of these propositions, but she's also got credences in 999 million other propositions. Phoebe's credences are all very accurate. Each of Daphne's credences, in contrast, are not very accurate at all; each is a little more accurate than it is inaccurate, but not by much. Whose doxastic state is better, Phoebe's or Daphne's? It is clear that this question is analogous to a question that has exercised ethicists over the past thirty years. How do we weigh a population consisting of some number of exceptionally happy and satisfied individuals against another population consisting of a much greater number of people whose lives are only just worth living? This is the question that occasions population ethics. In this paper, I go in search of the correct population ethics for credal states.

Beliefs come in different strengths. What are the norms that govern these strengths of belief? Let an agent's belief function at a particular time be the function that assigns, to each of the propositions about which she has an opinion, the strength of her belief in that proposition at that time. Traditionally, philosophers have claimed that an agent's belief function at any time ought to be a probability function, and that she ought to update her belief function upon obtaining new evidence by conditionalizing on that evidence. Until recently, the central arguments for these claims have been pragmatic. But these putative justifications fail to identify what is epistemically irrational about violating Probabilism or Conditionalization. A new approach, which I will call epistemic utility theory, attempts to remedy this. It treats beliefs as epistemic acts; and it appeals to the notion of an epistemic utility function, which measures of how epistemically valuable a particular belief function is for a particular way the world might be. It then formulates fundamental epistemic norms that are analogous to the fundamental practical norms that underlie decision theory. I survey the results obtained so far in this young research project, and present a sustained critique of certain assumptions that have been made by a number of philosophers working in this area.

One of the fundamental problems of epistemology is to say when the evidence in an agent’s possession justifies the beliefs she holds. In this paper and its prequel, we defend the Bayesian solution to this problem by appealing to the following fundamental norm: Accuracy An epistemic agent ought to minimize the inaccuracy of her partial beliefs. In the prequel, we made this norm mathematically precise; in this paper, we derive its consequences. We show that the two core tenets of Bayesianism follow from the norm, while the characteristic claim of the Objectivist Bayesian follows from the norm along with an extra assumption. Finally, we consider Richard Jeffrey’s proposed generalization of conditionalization. We show not only that his rule cannot be derived from the norm, unless the requirement of Rigidity is imposed from the start, but further that the norm reveals it to be illegitimate. We end by deriving an alternative updating rule for those cases in which Jeffrey’s is usually supposed to apply.

In 'On interpretations of arithmetic and set theory', Kaye and Wong proved the following result, which they considered to belong to the folklore of mathematical logic.

THEOREM 1 The first-order theories of Peano arithmetic and Zermelo-Fraenkel set theory with the axiom of infinity negated are bi-interpretable.

In this note, I describe a theory of sets that is bi-interpretable with the theory of bounded arithmetic IDelta0 + exp. Because of the weakness of this theory of sets, I cannot straightforwardly adapt Kaye and Wong's interpretation of the arithmetic in the set theory. Instead, I am forced to produce a different interpretation.

Richard Pettigrew offers an extended investigation into a particular way of justifying the rational principles that govern our credences. The main principles that he justifies are the central tenets of Bayesian epistemology, though many other related principles are discussed along the way. Pettigrew looks to decision theory in order to ground his argument. He treats an agent's credences as if they were a choice she makes between different options, gives an account of the purely epistemic utility enjoyed by different sets of credences, and then appeals to the principles of decision theory to show that, when epistemic utility is measured in this way, the credences that violate the principles listed above are ruled out as irrational. The account of epistemic utility set out here is the veritist's: the sole fundamental source of epistemic utility for credences is their accuracy. Thus, Pettigrew conducts an investigation in the version of epistemic utility theory known as accuracy-first epistemology

ABSTRACTThis book symposium onAccuracy and the Laws of Credenceconsists of an overview of the book’s argument by the author, Richard Pettigrew, together with four commentaries on different aspects of that argument. Ben Levinstein challenges the characterisation of the legitimate measures of inaccuracy that plays a central role in the arguments of the book. Julia Staffel asks whether the arguments of the book are compatible with an ontology of doxastic states that includes full beliefs as well as credences. Fabrizio Cariani raises concerns about the argument offered in the book for various chance-credence principles. And Sophie Horowitz questions the assumptions at play in the book’s argument for the Principle of Indifference, as well as asking how the various laws of credence considered in the book relate to one another.

There are many kinds of epistemic experts to which we might wish to defer in setting our credences. These include: highly rational agents, objective chances, our own future credences, our own current credences, and evidential probabilities. But exactly what constraint does a deference requirement place on an agent's credences? In this paper we consider three answers, inspired by three principles that have been proposed for deference to objective chances. We consider how these options fare when applied to the other kinds of epistemic experts mentioned above. Of the three deference principles we consider, we argue that two of the options face insuperable difficulties. The third, on the other hand, fares well|at least when it is applied in a particular way

In this paper, I pursue such a logical foundation for arithmetic in a variant of Zermelo set theory that has axioms of subset separation only for quantifier-free formulae, and according to which all sets are Dedekind finite. In section 2, I describe this variant theory, which I call ZFin0. And in section 3, I sketch foundations for arithmetic in ZFin0 and prove that certain foundational propositions that are theorems of the standard Zermelian foundation for arithmetic are independent of ZFin0.<br><br>An equivalent theory of sets and an equivalent foundation for arithmetic was introduced by John Mayberry and developed by the current author in his doctoral thesis. In that thesis, the independence results mentioned above are proved using proof-theoretic methods. In this paper, I offer model-theoretic proofs of the central independence results using the technique of cumulation models, which was introduced by Steve Popham, a doctoral student of Mayberry<br>from the early 1980s.

With his Humean thesis on belief, Leitgeb seeks to say how beliefs and credences ought to interact with one another. To argue for this thesis, he enumerates the roles beliefs must play and the properties they must have if they are to play them, together with norms that beliefs and credences intuitively must satisfy. He then argues that beliefs can play these roles and satisfy these norms if, and only if, they are related to credences in the way set out in the Humean thesis. I begin by raising questions about the roles that Leitgeb takes beliefs to play and the properties he thinks they must have if they are to play them successfully. After that, I question the assumption that, if there are categorical doxastic states at all, then there is just one kind of them—to wit, beliefs—such that the states of that kind must play all of these roles and conform to all of these norms. Instead, I will suggest, if there are categorical doxastic states, there may be many different kinds of such state such that, for each kind, the states of that type play some of the roles Leitgeb takes belief to play and each of which satisfies some of the norms he lists. As I will argue, the usual reasons for positing categorical doxastic states alongside credences all tell equally in favour of accepting a plurality of kinds of them. This is the thesis I dub pluralism about belief states.

Does category theory provide a foundation for mathematics that is autonomous with respect to the orthodox foundation in a set theory such as ZFC? We distinguish three types of autonomy: logical, conceptual, and justificatory. Focusing on a categorical theory of sets, we argue that a strong case can be made for its logical and conceptual autonomy. Its justificatory autonomy turns on whether the objects of a foundation for mathematics should be specified only up to isomorphism, as is customary in other branches of contemporary mathematics. If such a specification suffices, then a category-theoretical approach will be highly appropriate. But if sets have a richer `nature' than is preserved under isomorphism, then such an approach will be inadequate.

Philosophers of mathematics agree that the only interpretation of arithmetic that takes that discourse at 'face value' is one on which the expressions 'N', '0', '1', '+', and 'x' are treated as proper names. I argue that the interpretation on which these expressions are treated as akin to free variables has an equal claim to be the default interpretation of arithmetic. I show that no purely syntactic test can distinguish proper names from free variables, and I observe that any semantic test that can must beg the question. I draw the same conclusion concerning areas of mathematics beyond arithmetic. This paper is a greatly extended version of my response to Stewart Shapiro's paper in the conference 'Structuralism in physics and mathematics' held in Bristol on 2–3 December, 2006.

In ‘A Non-Pragmatic Vindication of Probabilism’, Jim Joyce attempts to ‘depragmatize’ de Finetti’s prevision argument for the claim that our partial beliefs ought to satisfy the axioms of probability calculus. In this paper, I adapt Joyce’s argument to give a non-pragmatic vindication of various versions of David Lewis’ Principal Principle, such as the version based on Isaac Levi's account of admissibility, Michael Thau and Ned Hall's New Principle, and Jenann Ismael's Generalized Principal Principle. Joyce enumerates properties that must be had by any measure of the distance from a set of partial beliefs to the set of truth values; he shows that, on any such measure, and for any set of partial beliefs that violates the probability axioms, there is a set that satisfies those axioms that is closer to every possible set of truth values. I replace truth values by objective chances in his argument; I show that for any set of partial beliefs that violates the probability axioms or a version of the Principal Principle, there is a set that satisfies them that is closer to every possible set of objective chances.