This paper argues that ‘that’-clauses are not singular terms (without denying that their semantical values are propositions). In its first part, three arguments are presented to support the thesis, two of which are defended against recent criticism. The two good arguments are based on the observation that substitution of ‘the proposition that p’ for ‘that p’ may result in ungrammaticality. The second part of the paper is devoted to a refutation of the main argument for the claim that ‘that’-clauses are (...) singular terms, namely that this claim is needed in order to account for the possibility of quantification into ‘that’-clause position. It is shown that not all quantification in natural languages is quantification into the position of singular terms, but that there is also so-called ‘non-nominal quantification’. A formal analysis of non-nominal quantification is given, and it is argued that quantification into ‘that’-clause position can be treated as another kind non-nominal quantification. (shrink)

While according to the inferentialists, meaning is always a kind of inferential role, proponents of other approaches to semantics often doubt that actual meanings, as they see them, can be generally reduced to inferential roles. In this paper we propose a formal framework for considering the hypothesis of the.

Second-order axiomatizations of certain important mathematical theories—such as arithmetic and real analysis—can be shown to be categorical. Categoricity implies semantic completeness, and semantic completeness in turn implies determinacy of truth-value. Second-order axiomatizations are thus appealing to realists as they sometimes seem to offer support for the realist thesis that mathematical statements have determinate truth-values. The status of second-order logic is a controversial issue, however. Worries about ontological commitment have been influential in the debate. Recently, Vann McGee has argued that one (...) can get some of the technical advantages of second-order axiomatizations—categoricity, in particular—while walking free of worries about ontological commitment. In so arguing he appeals to the notion of an open-ended schema—a schema that holds no matter how the language of the relevant theory is extended. Contra McGee, we argue that second-order quantification and open-ended schemas are on a par when it comes to ontological commitment. (shrink)

The aim of this article is to offer a method for determining the ontological commitments of a formalized theory. The second section shows that determining the consequence relation of a language model-theoretically entails that the ontology of a theory is tied very closely to the variables that feature in that theory. The third section develops an alternative way of determining the ontological commitments of a theory given a proof-theoretic account of the consequence relation for the language that theory is in. (...) It is shown that the proof-theoretic account of ontological commitment does not entail that the ontological commitments of a theory depend on the variables of that theory. The last section of the article discusses how this account of ontological commitment can be used in other philosophical projects such as Wright’s (Frege’s conception of numbers as objects, Aberdeen University Press, Aberdeen, 1983) abstractionism. The article concludes with a discussion of the upshots of adopting the proof-theoretic account of ontological commitment for ontology generally. (shrink)

After a critical presentation of the debate between absolutists and relativists regarding generality where I show that the debate is framed in a way that is bound to be harmful to the relativist’s position, I examine critically one of the customary arguments advanced against the relativist: the expressibility objection (according to which the relativist would be logically unable to express her own position). I then propose a radical way out of this debate-usually centered on semantic paradoxes-by arguing that it rests (...) on an unintelligible notion of “object”. I finally introduce a useful distinction between omnis and totus to elucidate the notions in play. (shrink)

Purity is known as an ideal of proof that restricts a proof to notions belonging to the ‘content’ of the theorem. In this paper, our main interest is to develop a conception of purity for formal (natural deduction) proofs. We develop two new notions of purity: one based on an ontological notion of the content of a theorem, and one based on the notions of surrogate ontological content and structural content. From there, we characterize which (classical) first-order natural deduction proofs (...) of a mathematical theorem are pure. Formal proofs that refer to the ontological content of a theorem will be called ‘fully ontologically pure’. Formal proofs that refer to a surrogate ontological content of a theorem will be called ‘secondarily ontologically pure’, because they preserve the structural content of a theorem. We will use interpretations between theories to develop a proof-theoretic criterion that guarantees secondary ontological purity for formal proofs. (shrink)

Amie Thomasson has defended a view called Easy Ontology, according to which most ontological questions can be answered straightforwardly using conceptual truths and empirical knowledge. Furthermore, she claims that this deflationary meta-ontology does not commit her to any form of anti-realism. In this paper I identify a problem with Thomasson’s account of quantification, according to which everything we quantify over falls under a sortal. Thomasson’s defence of the easiness of answering ontological questions relies on a certain thesis about the hierarchical (...) order of sortals, but the case for the compatibility of Easy Ontology and realism suggests that this thesis is actually false. (shrink)

This paper explores some variants and aspects of multi-quantificational criteria of existence, examining these in the context of the debate between monism and pluralism in analytical philosophy. Assuming familiarity with the findings to date, we seek to apply to these the newly introduced concepts of “substitution” and “substitutional model”. Possible applications of formal theories involving multiple types of existential quantifier are highlighted, together with their methods of construction. These considerations then lead to a thesis asserting the irrelevance of both multi-quantificational (...) criteria and assumptions involving quantificational ontology to the debate between monism and pluralism in ontology. Many quantifiers cannot properly distinguish different modes of existence–as we aim to show by furnishing a general method for constructing counter-examples to any theory that assumes that different types of existential quantifier correspond to different modes of existence. (shrink)

Peter Geach proposed a substitutional construal of quantification over thirty years ago. It is not standardly substitutional since it is not tied to those substitution instances currently available to us; rather, it is pegged to possible substitution instances. We argue that (i) quantification over the real numbers can be construed substitutionally following Geach's idea; (ii) a price to be paid, if it is that, is intuitionism; (iii) quantification, thus conceived, does not in itself relieve us of ontological commitment to real (...) numbers. (shrink)

Building on recent work by Delia Graff Fara and Ora Matushansky on appellative constructions like ‘Mirka called Roger handsome’, I argue that if Millianism about proper names is true, then the quantifier ‘something’ in ‘Mirka called Roger something’ is best understood as a kind of substitutional quantifier. Any adequate semantics for such quantifiers must explain both the logical behavior of ‘Mirka called Roger something’ and the acceptability of ‘so’-anaphora in ‘Mirka called Roger something, and everyone so called is handsome’. Millianism (...) about proper names is inconsistent with such quantifiers being standard non-substitutional second-order quantifiers. But this is not the only option for Millianism: I provide two different propositional semantics for substitutional quantification, each of which is adequate in the sense above, given Millianism. One of these is based on Tobias Rosefeldt’s work on non-nominal quantification, and I identify in what way Rosefeldt’s semantics is substitutional. (shrink)

It is common in metaphysical discourse to make claims like “Everything is self-identical” in which “everything” is intended to range over everything. This sort of “unrestricted” generality appears central to metaphysical discourse. But there is debate whether such generality, which appears to involve quantification over an all-inclusive domain, is even meaningful. To address this concern, Shaughan Lavine and Vann McGee supply competing accounts of the generality expressed by this use of “everything.” I argue that, from the perspective of the metaphysician, (...) neither of their proposals is entirely suitable. But their central insights, as well as their shortcomings, suggest an account which is suitable for metaphysical discourse, what I call “genuinely unrestricted quantification.” For while genuinely unrestricted quantification does not directly supply an account of the metaphysician's “everything,” it disentangles what are properly metaphysical issues from issues concerning how we ought to understand the quantifiers. It makes clear that whether the metaphysician's “everything” is meaningful cannot simply be resolved by supplying an appropriate account of our understanding of quantification. It depends on addressing certain substantive ontological questions. (shrink)

In “Proof-Theoretic Justification of Logic”, building on work by Dummett and Prawitz, I show how to construct use-based meaning-theories for the logical constants. The assertability-conditional meaning-theory takes the meaning of the logical constants to be given by their introduction rules; the consequence-conditional meaning-theory takes the meaning of the logical constants to be given by their elimination rules. I then consider the question: given a set of introduction rules \, what are the strongest elimination rules that are validated by an assertability (...) conditional meaning-theory based on \? I prove that the intuitionistic introduction rules are the strongest rules that are validated by the intuitionistic elimination rules. I then prove that intuitionistic logic is the strongest logic that can be given either an assertability-conditional or consequence-conditional meaning-theory. In “Grounding Grounding” I discuss the notion of grounding. My discussion revolves around the problem of iterated grounding-claims. Suppose that \ grounds \; what grounds that \ grounds that \? I argue that unless we can get a satisfactory answer to this question the notion of grounding will be useless. I discuss and reject some proposed accounts of iterated grounding claims. I then develop a new way of expressing grounding, propose an account of iterated grounding-claims and show how we can develop logics for grounding. In “Is the Vagueness Argument Valid?” I argue that the Vagueness Argument in favor of unrestricted composition isn’t valid. However, if the premisses of the argument are true and the conclusion false, mereological facts fail to supervene on non-mereological facts. I argue that this failure of supervenience is an artifact of the interplay between the necessity and determinacy operators and that it does not mean that mereological facts fail to depend on non-mereological facts. I sketch a deflationary view of ontology to establish this. (shrink)