Online research in philosophy

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. (shrink)

The goal of a partial belief is to be accurate, or close to the truth. By appealing to this norm, I seek norms for partial beliefs in self-locating and non-self-locating propositions. My aim is to find norms that are analogous to the Bayesian norms, which, I argue, only apply unproblematically to partial beliefs in non-self-locating propositions. I argue that the goal of a set of partial beliefs is to minimize the expected inaccuracy of those beliefs. However, in the self-locating framework, (...) there are two equally legitimate definitions of expected inaccuracy. And, while each gives rise to the same synchronic norm for partial beliefs, they give rise to different, inconsistent diachronic norms. I conclude that both norms are rationally permissible. En passant, I note that this entails that both Halfer and Thirder solutions to the well-known Sleeping Beauty puzzle are rationally permissible. (shrink)

A chance-credence norm states how an agent's credences in propositions concerning objective chances ought to relate to her credences in other propositions. The most famous such norm is the Principal Principle (PP), due to David Lewis. However, Lewis noticed that PP is inconsistent with many accounts of chance that attempt to reduce chance facts to non-modal facts. Those who defend such accounts of chance have offered two alternative chance-credence norms, both of which are consistent with reductionism about chance: the first (...) is the New Principle (NP), formulated by Ned Hall and Michael Thau and grudgingly accepted by Lewis; and the second is Jenann Ismael's General Recipe (IP). However, while NP and IP are each consistent with the sort of reductionism that conflicts with PP, they are incompatible with one another. Thus, the question arises: Which should the reductionist favour? In this paper, I argue that the consequences of IP when coupled with a reductionist account are unacceptable, so we must accept NP. I conclude by considering two responses to my arguments. (shrink)

Jim Joyce has presented an argument for Probabilism based on considerations of epistemic utility [Joyce, 1998]. In a recent paper, I adapted this argument to give an argument for Probablism and the Principal Principle based on similar considerations [Pettigrew, 2012]. Joyce’s argument assumes that a credence in a true proposition is better the closer it is to maximal credence, whilst a credence in a false proposition is better the closer it is to minimal credence. By contrast, my argument in that (...) paper assumed (roughly) that a credence in a proposition is better the closer it is to the objective chance of that proposition. In this paper, I present an epistemic utility argument for Probabilism and the Principal Principle that retains Joyce’s assumption rather than the alternative I endorsed in the earlier paper. I argue that this results in a superior argument for these norms. (shrink)

In the philosophy of mathematics, indispensability arguments aim to show that we are justified in believing that abstract mathematical objects exist. I wish to defend a particular objection to such arguments that has become increasingly popular recently. It is called instrumental nominalism. I consider the recent versions of this view and conclude that it has yet to be given an adequate formulation. I provide such a formulation and show that it can be used to answer the indispensability arguments. -/- There (...) are two main indispensability arguments in the literature, though one has received nearly all of the attention. They correspond to two ways in which we use mathematics in science and in everyday life. We use mathematical language to help us describe non-mathematical reality; and we use mathematical reasoning to help us perform inferences concerning non-mathematical reality using only a feasible amount of cognitive power. The former use is the starting point of the Quine-Putnam indispensability argument ([Quine, 1980a], [Quine, 1980b], [Quine, 1981a], [Quine, 1981b], [Putnam, 1979a], [Putnam, 1979b]); the latter provides the basis for Ketland’s more recent argument ([Ketland, 2005]). I begin by considering the Quine-Putnam argument and introduce instrumental nominalism to defuse it. Then I show that Ketland’s argument can be defused in a similar way. (shrink)

There has been much debate in philosophy about the relation between identity and distinctness on the one hand, and various forms of discernibility on the other. For instance, philosophers have debated the truth of the Principle of the Identity of Indiscernibles (PII), which is naturally formulated using a second-order quantifier ranging over some class of properties of particular philosophical significance.

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. (shrink)

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. We argue that, while a strong case can be made for its logical and conceptual autonomy, its justificatory autonomy turns on whether or not mathematical theories can be justified by appeal to mathematical practice. If they can, a category-theoretical approach will be fully autonomous; if not, (...) the most natural route to justificatory autonomy is blocked. (shrink)

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. (shrink)

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. (shrink)

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. (shrink)

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 sequel, 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 this paper, we make this norm mathematically precise in various ways. We describe three epistemic dilemmas that an agent might face if she attempts (...) to follow Accuracy, and we show that the only inaccuracy measures that do not give rise to such dilemmas are the quadratic inaccuracy measures. In the sequel, we derive the main tenets of Bayesianism from the relevant mathematical versions of Accuracy to which this characterization of the legitimate inaccuracy measures gives rise, but we also show that Jeffrey conditionalization has to be replaced by a different method of update in order for Accuracy to be satisfied. (shrink)

Review essay on Huber, F. and C. Schmidt-Petri (eds.) Degrees of Belief (Springer).

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. (shrink)

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. (shrink)

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. (shrink)