Stewart Shapiro

A typical interpreted formal language has (first‐order) variables that range over a collection of objects, sometimes called a domain‐of‐discourse. The domain is what the formal language is about. A language may also contain second‐order variables that range over properties, sets, or relations on the items in the domain‐of‐discourse, or over functions from the domain to itself. For example, the sentence ‘Alexander has all the qualities of a great leader’ would naturally be rendered with a second‐order variable ranging over qualities. Similarly, the sentence ‘there is a property that holds of all and only the prime numbers’ has a variable ranging over properties of natural numbers. Third‐order variables range over properties of properties, sets of sets, functions from properties to sets, etc. For example, according to some logicist accounts, the number 4 is the property shared by all properties that apply to exactly four objects in the domain. Accordingly, the number 4 is a third‐order item. Fourth‐order variables, and beyond, are characterized similarly. The phrase ‘higher‐order variable’ refers to the variables beyond first‐order.

Famously, Michael Dummett argues that considerations concerning the role of language in communication lead to the rejection of classical logic in favor of intuitionistic logic. Potentially, this results in massive revisions of established mathematics. Recently, Neil Tennant (“The law of excluded middle is synthetic a priori, if valid”, Philosophical Topics 24 (1996), 205-229) suggested that a Dummettian anti-realist can accept the law of excluded middle as a synthetic, a priori principle grounded on a metaphysical principle of determinacy. This article shows that the for the anti-realist, the law of excluded middle entails that humans have wildly implausible abilities. The proposed synthesis between anti-realism and classical mathematics thus fails.

We examine George Boolos's proposed abstraction principle for extensions based on the limitation-of-size conception, New V, from several perspectives. Crispin Wright once suggested that New V could serve as part of a neo-logicist development of real analysis. We show that it fails both of the conservativeness criteria for abstraction principles that Wright proposes. Thus, we support Boolos against Wright. We also show that, when combined with the axioms for Boolos's iterative notion of set, New V yields a system equivalent to full Zermelo-Fraenkel set theory with a principle of global choice. This advances Boolos's longstanding interest in the foundations of set theory.

The is an old question over whether there is a substantial disagreement between advocates of different logics, as they simply attach different meanings to the crucial logical terminology. The purpose of this article is to revisit this old question in light a pluralism/relativism that regards the various logics as equally legitimate, in their own contexts. We thereby address the vexed notion of translation, as it occurs between mathematical theories. We articulate and defend a thesis that the notion of “same meaning” is itself context-sensitive, depending on the purposes of a given conversation.

To get to grips with what Shapiro does and can say about higher-order vagueness, it is first necessary to thoroughly review and evaluate his conception of (first-order) vagueness, a conception which is both rich and suggestive but, as it turns out, not so easy to stabilise. In Sections I–IV, his basic position on vagueness (see Shapiro [2003]) is outlined and assessed. As we go along, I offer some suggestions for improvement. In Sections V–VI, I review two key paradoxes of higher-order vagueness, while in Section VII, I explore a possible line of response to such paradoxes given by Keefe [2000]. In Section VIII, I assess whether which Shapiro might adapt Keefe's response to combat both paradoxes.

This article concerns the ongoing neo-logicist program in the philosophy of mathematics. The enterprise began life, in something close to its present form, with Crispin Wright’s seminal [1983]. It was bolstered when Bob Hale [1987] joined the fray on Wright’s behalf and it continues through many extensions, objections, and replies to objections . The overall plan is to develop branches of established mathematics using abstraction principles in the form: Formula where a and b are variables of a given type , Σ is a higher-order operator denoting a function from items of the given type to objects in the range of the first-order variables, and E is an equivalence relation over items of the given type. In what follows, I will sometimes omit the initial quantifiers.Frege [1884, 1893] himself employed three abstraction principles. One of them, used for illustration, comes from geometry: "The direction of l1 is identical to the direction of l2 if and only if l1 is parallel to l2."Call this the direction principle. The second was dubbed N= in [Wright, 1983] and is now called Hume’s principle: Formula where F≈G is an abbreviation of the second-order statement that there is a one-to-one relation mapping the F’s onto the G’s. In words, states that the number of F is identical to the number of G if and only if F is equinumerous with G. Unlike the direction-principle, the relevant variables, F, G here are second-order. Georg Cantor …

This paper uses neo-Fregean-style abstraction principles to develop the integers from the natural numbers (assuming Hume’s principle), the rational numbers from the integers, and the real numbers from the rationals. The first two are first-order abstractions that treat pairs of numbers: (DIF) INT(a,b)=INT(c,d) ≡ (a+d)=(b+c). (QUOT) Q(m,n)=Q(p,q) ≡ (n=0 & q=0) ∨ (n≠0 & q≠0 & m⋅q=n⋅p). The development of the real numbers is an adaption of the Dedekind program involving “cuts” of rational numbers. Let P be a property (of rational numbers) and r a rational number. Say that r is an upper bound of P, written P≤r, if for any rational number s, if Ps then either s<r or s=r. In other words, P≤r if r is greater than or equal to any rational number that P applies to. Consider the Cut Abstraction Principle: (CP) ∀P∀Q(C(P)=C(Q) ≡ ∀r(P≤r ≡ Q≤r)). In other words, the cut of P is identical to the cut of Q if and only if P and Q share all of their upper bounds. The axioms of second-order real analysis can be derived from (CP), just as the axioms of second-order Peano arithmetic can be derived from Hume’s principle. The paper raises some of the philosophical issues connected with the neo-Fregean program, using the above abstraction principles as case studies.