If mathematics is regarded as a science, then the philosophy of mathematics can be regarded as a branch of the philosophy of science, next to disciplines such as the philosophy of physics and the philosophy of biology. However, because of its subject matter, the philosophy of mathematics occupies a special place in the philosophy of science. Whereas the natural sciences investigate entities that are located in space and time, it is not at all obvious that this is also the case (...) with respect to the objects that are studied in mathematics. In addition to that, the methods of investigation of mathematics differ markedly from the methods of investigation in the natural sciences. Whereas the latter acquire general knowledge using inductive methods, mathematical knowledge appears to be acquired in a different way, namely, by deduction from basic principles. The status of mathematical knowledge also appears to differ from the status of knowledge in the natural sciences. The theories of the natural sciences appear to be less certain and more open to revision than mathematical theories. For these reasons mathematics poses problems of a quite distinctive kind for philosophy. Therefore philosophers have accorded special attention to ontological and epistemological questions concerning mathematics. (shrink)

To define new property terms, we combine already familiar ones by means of certain logical operations. Given suitable constraints, these operations may presumably include the resources of first-order logic: truth-functional sentence connectives and quantification over objects. What is far less clear is whether we can also use modal operators for this purpose. This paper clarifies what is involved in this question, and argues in favor of modal property definitions.

Contemporary accounts of logic and language cannot give proper treatments of plural constructions of natural languages. They assume that plural constructions are redundant devices used to abbreviate singular constructions. This paper and its sequel, "The logic and meaning of plurals, II", aim to develop an account of logic and language that acknowledges limitations of singular constructions and recognizes plural constructions as their peers. To do so, the papers present natural accounts of the logic and meaning of plural constructions that result (...) from the view that plural constructions are, by and large, devices for talking about many things (as such). The account of logic presented in the papers surpasses contemporary Fregean accounts in its scope. This extension of the scope of logic results from extending the range of languages that logic can directly relate to. Underlying the view of language that makes room for this is a perspective on reality that locates in the world what plural constructions can relate to. The papers suggest that reflections on plural constructions point to a broader framework for understanding logic, language, and reality that can replace the contemporary Fregean framework as this has replaced its Aristotelian ancestor. (shrink)

Shapiro (Philos Q 61:320–342, 2011) argues that, if we are deflationists about truth, we should be deflationists about logical consequence. Like the truth predicate, he claims, the logical consequence predicate is merely a device of generalisation and more substantial characterisation, e.g. proof- or model-theoretic, is mistaken. I reject his analogy between truth and logical consequence and argue that, by appreciating how the logical consequence predicate is used as well as the goals of proof theory and model theory, we can be (...) deflationists about truth but not logical consequence. (shrink)

Semantic theories based on a hierarchy of types have prominently been used to defend the possibility of unrestricted quantification. However, they also pose a prima facie problem for it: each quantifier ranges over at most one level of the hierarchy and is therefore not unrestricted. It is difficult to evaluate this problem without a principled account of what it is for a quantifier to be unrestricted. Drawing on an insight of Russell’s about the relationship between quantification and the structure of (...) predication, we offer such an account. We use this account to examine the problem in three different type-theoretic settings, which are increasingly permissive with respect to predication. We conclude that unrestricted quantification is available in all but the most permissive kind of type theory. (shrink)

Second-order logic has a number of attractive features, in particular the strong expressive resources it offers, and the possibility of articulating categorical mathematical theories (such as arithmetic and analysis). But it also has its costs. Five major charges have been launched against second-order logic: (1) It is not axiomatizable; as opposed to first-order logic, it is inherently incomplete. (2) It also has several semantics, and there is no criterion to choose between them (Putnam, J Symbol Logic 45:464–482, 1980 ). Therefore, (...) it is not clear how this logic should be interpreted. (3) Second-order logic also has strong ontological commitments: (a) it is ontologically committed to classes (Resnik, J Phil 85:75–87, 1988 ), and (b) according to Quine (Philosophy of logic, Prentice-Hall: Englewood Cliffs, 1970 ), it is nothing more than “set theory in sheep’s clothing”. (4) It is also not better than its first-order counterpart, in the following sense: if first-order logic does not characterize adequately mathematical systems, given the existence of non - isomorphic first-order interpretations, second-order logic does not characterize them either, given the existence of different interpretations of second-order theories (Melia, Analysis 55:127–134, 1995 ). (5) Finally, as opposed to what is claimed by defenders of second-order logic [such as Shapiro (J Symbol Logic 50:714–742, 1985 )], this logic does not solve the problem of referential access to mathematical objects (Azzouni, Metaphysical myths, mathematical practice: the logic and epistemology of the exact sciences, Cambridge University Press, Cambridge, 1994 ). In this paper, I argue that the second-order theorist can solve each of these difficulties. As a result, second-order logic provides the benefits of a rich framework without the associated costs. (shrink)

A neutralist framework is an account of the second-order quantifiers which does not by itself tell us what the ontological commitments of second-order quantification are, but which does tell us that those commitments cannot exceed those of predication. Recently, Wright has suggested that an inferentialist account of the second-order quantifiers is an adequate neutralist framework. I show that we do not have to become inferentialists in the pursuit of a neutralist framework: such a framework can be established within the semantic (...) tradition. (shrink)