Aim of the paper is to revise Boolos’ reinterpretation of second-order monadic logic in terms of plural quantification ([4], [5]) and expand it to full second order logic. Introducing the idealization of plural acts of choice, performed by a suitable team of agents, we will develop a notion of plural reference . Plural quantification will be then explained in terms of plural reference. As an application, we will sketch a structuralist reconstruction of second-order arithmetic based on the axiom of infinite (...) à la Dedekind, as the unique non-logical axiom. We will also sketch a virtual interpretation of the classical continuum involving no other infinite than a countable plurality of individuals. (shrink)

This book surveys the assortment of methods put forth for fixing Frege's system, in an attempt to determine just how much of mathematics can be reconstructed in ...

Two fundamental rules of reasoning are Universal Generalisation and Existential Instantiation. Applications of these rules involve stipulations such as ‘Let n be an arbitrary number’ or ‘Let John be an arbitrary Frenchman’. Yet the semantics underlying such stipulations are far from clear. What, for example, does ‘n’ refer to following the stipulation that n be an arbitrary number? In this paper, we argue that ‘n’ refers to a number—an ordinary, particular number such as 58 or 2,345,043. Which one? We do (...) not and cannot know, because the reference of ‘n’ is fixed arbitrarily. Underlying this proposal is a more general thesis: Arbitrary Reference : It is possible to fix the reference of an expression arbitrarily. When we do so, the expression receives its ordinary kind of semantic-value, though we do not and cannot know which value in particular it receives. Our aim in this paper is defend AR. In particular, we argue that AR can be used to provide an account of instantial reasoning, and we suggest that AR can also figure in offering new solutions to a range of difficult philosophical puzzles. (shrink)

PG (Plural Grundgesetze) is a predicative monadic second-order system which exploits the notion of plural quantification and a few Fregean devices, among which a formulation of the infamous Basic Law V. It is shown that second-order Peano arithmetic can be derived in PG. I also investigate the philosophical issue of predicativism connected to PG. In particular, as predicativism about concepts seems rather un-Fregean, I analyse whether there is a way to make predicativism compatible with Frege’s logicism.

PG (Plural Grundgesetze) is a predicative monadic second-order system which is aimed to derive second-order Peano arithmetic. It exploits the notion of plural quantification and a few Fregean devices, among which the infamous Basic Law V. In this paper, a model-theoretical consistency proof for the system PG is provided.

In this paper, I consider two curious subsystems ofFrege's Grundgesetze der Arithmetik: Richard Heck's predicative fragment H, consisting of schema V together with predicative second-order comprehension (in a language containing a syntactical abstraction operator), and a theory T in monadic second-order logic, consisting of axiom V and 1 1-comprehension (in a language containing anabstraction function). I provide a consistency proof for the latter theory, thereby refuting a version of a conjecture by Heck. It is shown that both Heck and T (...) prove the existence of infinitely many non-logical objects (T deriving,moreover, the nonexistence of the value-range concept). Some implications concerning the interpretation of Frege's proof of referentiality and the possibility of classifying any of these subsystems as logicist are discussed. Finally, I explore the relation of T toCantor's theorem which is somewhat surprising. (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)

This paper criticizes George Boolos's famous use of plural quantification to argue that monadic second-order logic is pure logic. I deny that plural quantification qualifies as pure logic and express serious misgivings about its alleged ontological innocence. My argument is based on an examination of what is involved in our understanding of the impredicative plural comprehension schema.

Say that some things form a set just in case there is a set whose members are precisely the things in question. For instance, all the inhabitants of New York form a set. So do all the stars in the universe. And so do all the natural numbers. Under what conditions do some things form a set?