•  77
    How to type: Reply to Halbach
    Analysis 69 (2): 280-286. 2009.
    In my paper , I noted that Fitch's argument, which purports to show that if all truths are knowable then all truths are known, can be blocked by typing knowledge. If there is not one knowledge predicate, ‘ K’, but infinitely many, ‘ K 1’, ‘ K 2’, … , then the type rules prevent application of the predicate ‘ K i’ to sentences containing ‘ K i’ such as ‘ p ∧¬ K i⌜ p⌝’. This provides a motivated response to Fitch's argument so long as knowledge typing is itself motivated. It was the burden of my p…Read more
  •  316
    Defining ultimate ontological basis and the fundamental layer
    Philosophical Quarterly 60 (238): 169-175. 2010.
    I explain why Ross Cameron's definition of ultimate ontological basis is incorrect, and propose a different definition in terms of ontological dependence, as well as a definition of reality's fundamental layer. These new definitions cover the conceptual possibility that self-dependent entities exist. They also apply to different conceptions of the relation of ontological dependence.
  •  202
    Resemblance theories of properties
    Philosophical Studies 157 (3): 361-382. 2012.
    The paper aims to develop a resemblance theory of properties that technically improves on past versions. The theory is based on a comparative resemblance predicate. In combination with other resources, it solves the various technical problems besetting resemblance nominalism. The paper’s second main aim is to indicate that previously proposed resemblance theories that solve the technical problems, including the comparative theory, are nominalistically unacceptable and have controversial philosop…Read more
  •  117
    Motivating reductionism about sets
    Australasian Journal of Philosophy 86 (2). 2008.
    The paper raises some difficulties for the typical motivations behind set reductionism, the view that sets are reducible to entities identified independently of set theory.
  •  77
    Although the case for the judgment-dependence of many other domains has been pored over, surprisingly little attention has been paid to mathematics and logic. This paper presents two dilemmas for a judgment-dependent account of these areas. First, the extensionality-substantiality dilemma: in each case, either the judgment-dependent account is extensionally inadequate or it cannot meet the substantiality condition (roughly: non-vacuous specification). Second, the extensionality-extremality dilem…Read more
  •  81
    The subtraction argument(s)
    Dialectica 60 (2). 2006.
    The subtraction argument aims to show that there is an empty world, in the sense of a possible world with no concrete objects. The argument has been endorsed by several philosophers. I show that there are currently two versions of the argument around, and that only one of them is valid. I then sketch the main problem for the valid version of the argument
  •  215
    Proofs of the Compactness Theorem
    History and Philosophy of Logic 31 (1): 73-98. 2010.
    In this study, several proofs of the compactness theorem for propositional logic with countably many atomic sentences are compared. Thereby some steps are taken towards a systematic philosophical study of the compactness theorem. In addition, some related data and morals for the theory of mathematical explanation are presented
  •  166
    Justifying induction mathematically: Strategies and functions
    Logique Et Analyse 51 (203): 263. 2008.
    If the total state of the universe is encodable by a real number, Hardin and Taylor have proved that there is a solution to one version of the problem of induction, or at least a solution to a closely related epistemological problem. Is this philosophical application of the Hardin-Taylor result modest enough? The paper advances grounds for doubt. [A longer and more detailed sequel to this paper, 'Proving Induction', was published in the Australasian Journal of Logic in 2011.]
  •  328
    Naturalism in mathematics and the authority of philosophy
    British Journal for the Philosophy of Science 56 (2): 377-396. 2005.
    Naturalism in the philosophy of mathematics is the view that philosophy cannot legitimately gainsay mathematics. I distinguish between reinterpretation and reconstruction naturalism: the former states that philosophy cannot legitimately sanction a reinterpretation of mathematics (i.e. an interpretation different from the standard one); the latter that philosophy cannot legitimately change standard mathematics (as opposed to its interpretation). I begin by showing that neither form of naturalism …Read more
  •  142
    Naturalism in the Philosophy of Mathematics
    In Peter Adamson (ed.), Stanford Encyclopedia of Philosophy, Stanford Encyclopedia of Philosophy. 2012.
    Contemporary philosophy’s three main naturalisms are methodological, ontological and epistemological. Methodological naturalism states that the only authoritative standards are those of science. Ontological and epistemological naturalism respectively state that all entities and all valid methods of inquiry are in some sense natural. In philosophy of mathematics of the past few decades methodological naturalism has received the lion’s share of the attention, so we concentrate on this. Ontological…Read more
  •  183
    Boolos on the justification of set theory
    Philosophia Mathematica 15 (1): 30-53. 2007.
    George Boolos has argued that the iterative conception of set justifies most, but not all, the ZFC axioms, and that a second conception of set, the Frege-von Neumann conception (FN), justifies the remaining axioms. This article challenges Boolos's claim that FN does better than the iterative conception at justifying the axioms in question.
  •  112
    What the foundationalist filter kept out
    Studies in History and Philosophy of Science Part A 36 (1): 191-201. 2005.
    From title to back cover, a polemic runs through David Corfield's "Towards a Philosophy of Real Mathematics". Corfield repeatedly complains that philosophers of mathematics have ignored the interesting and important mathematical developments of the past seventy years, ‘filtering’ the details of mathematical practice out of philosophical discussion. His aim is to remedy the discipline’s long-sightedness and, by precept and example, to redirect philosophical attention towards current developments …Read more
  •  30
    Proofs of the Compactness Theorem
    History and Philosophy of Logic 32 (4): 407-407. 2011.
    In this study, the author compares several proofs of the compactness theorem for propositional logic with countably many atomic sentences. He thereby takes some steps towards a systematic philosophical study of the compactness theorem. He also presents some data and morals for the theory of mathematical explanation. [The author is not responsible for the horrific mathematical typo in the second sentence.]