Can Quine’s criterion for ontological commitment be comparatively applied across different logics? If so, how? Cross-logical evaluations of discourses are central to contemporary philosophy of mathematics and metaphysics. The focus here is on the influential and important arguments of George Boolos and David Lewis that second-order logic and plural quantification don’t incur additional ontological commitments over and above those incurred by first-order quantifiers. These arguments are challenged by the exhibition of a technical tool—the truncation-model construction of notational equivalents—that compares the (...) ontological role and increased expressive strength of non-first-order ideology to first-order ideology. (shrink)

Computationalism holds that our grasp of notions like ‘computable function’ can be used to account for our putative ability to refer to the standard model of arithmetic. Tennenbaum's Theorem has been repeatedly invoked in service of this claim. I will argue that not only do the relevant class of arguments fail, but that the result itself is most naturally understood as having the opposite of a reference-fixing effect — i.e., rather than securing the determinacy of number-theoretic reference, Tennenbaum's Theorem points (...) towards a sense in which portions of our computational vocabulary should be regarded as model-relative. (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)

One cannot escape the feeling that these mathematical formulae have an independent existence and an intelligence of their own, that they are wiser than we are, wiser even than their discoverers.

11We thank Rohan French for a detailed discussion of this review. We also wish to reciprocally thank Shawn Standefer for detailed discussions about the book.Logical pluralism is the view according...

I discuss and try to evaluate the argument about constructible sets made by Putnam in ‘ ”Models and Reality”, and some of the counterarguments directed against it in the literature. I shall conclude that Putnam’s argument, while correct in substance, nevertheless has no direct bearing on the philosophical question of unintended models of set theory.

It is often remarked that first-order Peano Arithmetic is non-categorical but deductively well-behaved, while second-order Peano Arithmetic is categorical but deductively ill-behaved. This suggests that, when it comes to axiomatizations of mathematical theories, expressive power and deductive power may be orthogonal, mutually exclusive desiderata. In this paper, I turn to Hintikka’s :69–90, 1989) distinction between descriptive and deductive approaches in the foundations of mathematics to discuss the implications of this observation for the first-order logic versus second-order logic divide. The descriptive (...) approach is illustrated by Dedekind’s ‘discovery’ of the need for second-order concepts to ensure categoricity in his axiomatization of arithmetic; the deductive approach is illustrated by Frege’s Begriffsschrift project. I argue that, rather than suggesting that any use of logic in the foundations of mathematics is doomed to failure given the impossibility of combining the descriptive approach with the deductive approach, what this apparent predicament in fact indicates is that the first-order versus second-order divide may be too crude to investigate what an adequate axiomatization of arithmetic should look like. I also conclude that, insofar as there are different, equally legitimate projects one may engage in when working on the foundations of mathematics, there is no such thing as the One True Logic for this purpose; different logical systems may be adequate for different projects. (shrink)

We will formulate some analogous higher-order versions of Skolem’s paradox and assess the generalizability of two solutions for Skolem’s paradox to these paradoxes: the textbook approach and that of Bays (2000). We argue that the textbook approach to handle Skolem’s paradox cannot be generalized to solve the parallel higher-order paradoxes, unless it is augmented by the claim that there is no unique language within which the practice of mathematics can be formalized. Then, we argue that Bays’ solution to the original (...) Skolem’s paradox, unlike the textbook solution, can be generalized to solve the higher-order paradoxes without any implication about the possibility or order of a language in which mathematical practice is to be formalized. (shrink)

The purpose of this article is to delimit what can and cannot be claimed on behalf of second-order logic. The starting point is some of the discussions surrounding my Foundations without Foundationalism: A Case for Secondorder Logic.

Theories in the usual sense, as characterized by a language and a set of theorems in that language ("statement view"), are related to theories in the structuralist sense, in turn characterized by a set of potential models and a subset thereof as models ("non-statement view", J. Sneed, W. Stegmüller). It is shown that reductions of theories in the structuralist sense (that is, functions on structures) give rise to so-called "representations" of theories in the statement sense and vice versa, where representations (...) are understood as functions that map sentences of one theory into another theory. It is argued that commensurability between theories should be based on functions on open formulas and open terms so that reducibility does not necessarily imply commensurability. This is in accordance with a central claim by Stegmüller on the compatibility of reducibility and incommensurability that has recently been challenged by D. Pearce. (shrink)