Saul Kripke once noted that there is a tight connection between computation and de re knowledge of whatever the computation acts upon. For example, the Euclidean algorithm can produce knowledge of which number is the greatest common divisor of two numbers. Arguably, algorithms operate directly on syntactic items, such as strings, and on numbers and the like only via how the numbers are represented. So we broach matters of notation. The purpose of this article is to explore the relationship between (...) the notations acceptable for computation, the usual idealizations involved in theories of computability, flowing from Alan Turing’s monumental work, and de re propositional attitudes toward numbers and other mathematical objects. (shrink)

In recent years philosophers have used results from cognitive science to formulate epistemologies of arithmetic :5–18, 2001). Such epistemologies have, however, been criticised, e.g. by Azzouni, for interpreting the capacities found by cognitive science in an overly numerical way. I offer an alternative framework for the way these psychological processes can be combined, forming the basis for an epistemology for arithmetic. The resulting framework avoids assigning numerical content to the Approximate Number System and Object Tracking System, two systems that have (...) so far been the basis of epistemologies of arithmetic informed by cognitive science. The resulting account is, however, only a framework for an epistemology: in the final part of the paper I argue that it is compatible with both platonist and nominalist views of numbers by fitting it into an epistemology for ante rem structuralism and one for fictionalism. Unsurprisingly, cognitive science does not settle the debate between these positions in the philosophy of mathematics, but I it can be used to refine existing epistemologies and restrict our focus to the capacities that cognitive science has found to underly our mathematical knowledge. (shrink)

Linnebo and Pettigrew have recently developed a version of non-eliminative mathematical structuralism based on Fregean abstraction principles. They recognize that this version of structuralism is vulnerable to the well-known problem of non-rigid structures. This paper offers a solution to the problem for this version of structuralism. The solution involves expanding the languages used to describe mathematical structures. We then argue that this solution is philosophically acceptable to those who endorse mathematical structuralism based on Fregean abstraction principles.

Saul Kripke once noted that there is a tight connection between computation and de re knowledge of whatever the computation acts upon. For example, the Euclidean algorithm can produce knowledge of _which number_ is the greatest common divisor of two numbers. Arguably, algorithms operate directly on syntactic items, such as strings, and on numbers and the like only via how the numbers are represented. So we broach matters of _notation_. The purpose of this article is to explore the relationship between (...) the notations acceptable for computation, the usual idealizations involved in theories of computability, flowing from Alan Turing’s monumental work, and de re propositional attitudes toward numbers and other mathematical objects. (shrink)

In some sense, both ontological and epistemological problems related to individuation have been the focal issues in the philosophy of mathematics ever since Frege. However, such an interest becomes manifest in the rise of structuralism as one of the most promising positions in recent philosophy of mathematics. The most recent controversy between Keränen and Shapiro seems to be the culmination of this phenomenon. Rather than taking sides, in this paper, I propose to critically examine some common assumptions shared by both (...) parties. In particular, I shall focus on their assumptions on haecceity as an individual essence, haecceity as a property, the classification of properties, and thereby the search for the principle of individuation in terms of properties. I shall argue that all these assumptions are mistaken and ungrounded from Scotus’ point of view. Further, I will fathom what consequences would follow, if we reject each of these assumptions. (shrink)

Recent work in the philosophy of mathematics has suggested that mathematical structuralism is not committed to a strong form of the Identity of Indiscernibles (II). José Bermúdez demurs, and argues that a strong form of II can be warranted on structuralist grounds by countenancing identity properties, or haecceities, as legitimately structural. Typically, structuralists dismiss such properties as obviously non-structural. I will argue to the contrary that haecceities can be viewed as structural but that this concession does not warrant Bermúdez’s version (...) of II but, rather, another easily falsified version. I close with some reflections on reference vis-à-vis structurally indiscernible objects. (shrink)

Is it possible to maintain classical logic, stay close to classical semantics, and yet accept that language might be semantically indeterminate? The article gives an affirmative answer by Ramsifying classical semantics, which yields a new semantic theory that remains much closer to classical semantics than supervaluationism but which at the same time avoids the problematic classical presupposition of semantic determinacy. The resulting Ramsey semantics is developed in detail, it is shown to supply a classical concept of truth and to fully (...) support the rules and metarules of classical logic, and it is applied to vague terms as well as to theoretical or open-ended terms from mathematics and science. The theory also demonstrates how diachronic or synchronic interpretational continuity across languages is compatible with semantic indeterminacy. (shrink)

This is Part B of an article that defends non-eliminative structuralism about mathematics by means of a concrete case study: a theory of unlabeled graphs. Part A motivated an understanding of unlabeled graphs as structures sui generis and developed a corresponding axiomatic theory of unlabeled graphs. Part B turns to the philosophical interpretation and assessment of the theory: it points out how the theory avoids well-known problems concerning identity, objecthood, and reference that have been attributed to non-eliminative structuralism. The part (...) concludes by explaining how the theory relates to set theory, and what remains to be accomplished for non-eliminative structuralists. (shrink)

Ante rem structures were posited as the subject matter of mathematics in order to resolve a problem of referential indeterminacy within mathematical discourse. Nevertheless, ante rem structuralists are inevitably committed to the existence of indiscernible entities, and this commitment produces an exactly analogous problem. If it cannot be sorted out, then the postulation of ante rem structures is futile. In a recent paper, Stewart Shapiro argued that the problem may be solved by analysing some of the singular terms of mathematics (...) not as genuinely referring expressions, but as instantial terms. In this paper, I discuss several competing accounts of the semantics of terms of this kind, and argue that they are all untenable for the ante rem structuralist. Shapiro, then, still owes us an account of the semantics of instantial terms that suits the ante rem structuralist project. Without it, the ante rem structuralist is still unable to determine the reference of the singular terms of mathematics. (shrink)

There are several relations which may fall short of genuine identity, but which behave like identity in important respects. Such grades of discrimination have recently been the subject of much philosophical and technical discussion. This paper aims to complete their technical investigation. Grades of indiscernibility are defined in terms of satisfaction of certain first-order formulas. Grades of symmetry are defined in terms of symmetries on a structure. Both of these families of grades of discrimination have been studied in some detail. (...) However, this paper also introduces grades of relativity, defined in terms of relativeness correspondences. This paper explores the relationships between all the grades of discrimination, exhaustively answering several natural questions that have so far received only partial answers. It also establishes which grades can be captured in terms of satisfaction of object-language formulas and draws connections with definability theory. (shrink)

In recent years philosophers have used results from cognitive science to formulate epistemologies of arithmetic :5–18, 2001). Such epistemologies have, however, been criticised, e.g. by Azzouni, for interpreting the capacities found by cognitive science in an overly numerical way. I offer an alternative framework for the way these psychological processes can be combined, forming the basis for an epistemology for arithmetic. The resulting framework avoids assigning numerical content to the Approximate Number System and Object Tracking System, two systems that have (...) so far been the basis of epistemologies of arithmetic informed by cognitive science. The resulting account is, however, only a framework for an epistemology: in the final part of the paper I argue that it is compatible with both platonist and nominalist views of numbers by fitting it into an epistemology for ante rem structuralism and one for fictionalism. Unsurprisingly, cognitive science does not settle the debate between these positions in the philosophy of mathematics, but I it can be used to refine existing epistemologies and restrict our focus to the capacities that cognitive science has found to underly our mathematical knowledge. (shrink)

Neofregeanism and structuralism are among the most promising recent approaches to the philosophy of mathematics. Yet both have serious costs. We develop a view, structuralist neologicism, which retains the central advantages of each while avoiding their more serious costs. The key to our approach is using arbitrary reference to explicate how mathematical terms, introduced by abstraction principles, refer. Focusing on numerical terms, this allows us to treat abstraction principles as implicit definitions determining all properties of the numbers, achieving a key (...) neofregean advantage, while preserving the key structuralist advantage, which objects play the number role does not matter. (shrink)

The realist versions of mathematical structuralism are often characterized by what I call ‘the insubstantiality thesis’, according to which mathematical objects, being positions in structures, have no non-structural properties: they are purely structural objects. The thesis has been criticized for being inconsistent or descriptively inadequate. In this paper, by implementing the resources of a real-definitional account of essence in the context of Fregean abstraction principles, I offer a version of structuralism – essentialist structuralism – which validates a weaker version of (...) the insubstantiality thesis: mathematical objects have no non-structural essential properties. Next, I show how this rendition of structuralism alleviates a Fregean worry against insubstantiality, which is directed at the explanation of the applicability of mathematics from the structuralist perspective. (shrink)

A version of the permutation argument in the philosophy of mathematics leads to the thesis that mathematical terms, contrary to appearances, are not genuine singular terms referring to individual objects; they are purely schematic or variables. By postulating ‘ante-rem structures’, the ante-rem structuralist aims to defuse the permutation argument and retain the referentiality of mathematical terms. This paper presents two semantic problems for the ante- rem view: (1) ante-rem structures are themselves subject to the permutation argument; (2) the ante-rem structuralist (...) fails to explain reference in a way that makes her account different to, and privileged over, that of her eliminativist rivals. Both problems undercut the motivation behind ante-rem structuralism. (shrink)

There are two ways of thinking about the natural numbers: as ordinal numbers or as cardinal numbers. It is, moreover, well-known that the cardinal numbers can be defined in terms of the ordinal numbers. Some philosophies of mathematics have taken this as a reason to hold the ordinal numbers as (metaphysically) fundamental. By discussing structuralism and neo-logicism we argue that one can empirically distinguish between accounts that endorse this fundamentality claim and those that do not. In particular, we argue that (...) if the ordinal numbers are metaphysically fundamental then it follows that one cannot acquire cardinal number concepts without appeal to ordinal notions. On the other hand, without this fundamentality thesis that would be possible. This allows for an empirical test to see which account best describes our actual mathematical practices. We then, finally, discuss some empirical data that suggests that we can acquire cardinal number concepts without using ordinal notions. However, there are some important gaps left open by this data that we point to as areas for future empirical research. (shrink)

Languages involving modalities and languages involving vagueness have each been thoroughly studied. On the other hand, virtually nothing has been said about the interaction of modality and vagueness. This paper aims to start filling that gap. Section 1 is a discussion of various possible sources of vague modality. Section 2 puts forward a model theory for a quantified language with operators for modality and vagueness. The model theory is followed by a discussion of the resulting logic. In Section 3, the (...) framework will permit us to address a puzzle raised by Elizabeth Barnes and Robert Williams. (shrink)

I show that the indeterminacy problem for computational structuralists is in fact far more problematic than even the harshest critic of structuralism has realised; it is not a bullet which can be bitten by structuralists as previously thought. Roughly, this is because the structural indeterminacy of logic-gates such as AND/OR is caused by the structural identity of the binary computational digits 0/1 themselves. I provide a proof that pure computational structuralism is untenable because structural indeterminacy entails absurd consequences - namely, (...) that there is only one binary computational digit. I conclude that accounting for individuation is a more important desiderata for a theory of computation than even that of triviality. -/- . (shrink)

Conditional excluded middle (CEM) is the following principe of counterfactual logic: either, if it were the case that φ, it would be the case that ψ, or, if it were the case that φ, it would be the case that not-ψ. I will first show that CEM entails the identity of indiscernibles, the falsity of physicalism, and the failure of the modal to supervene on the categorical and of the vague to supervene on the precise. I will then argue that (...) we should accept these startling conclusions, since CEM is valid. (shrink)