© The Author [2017]. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: [email protected] Dedekind was a contemporary of Bernhard Riemann, Georg Cantor, and Gottlob Frege, among others. Together, they revolutionized mathematics and logic in the second half of the nineteenth century. Dedekind had an especially strong influence on David Hilbert, Ernst Zermelo, Emmy Noether, and Nicolas Bourbaki, who completed that revolution in the twentieth century. With respect to mainstream mathematics, he is best known for his contributions (...) to algebra and number theory. With respect to logic and the foundations of mathematics, many of his technical results — his conceptualization of the natural and real numbers, his analysis of proofs by mathematical induction and definitions by recursion (extended to the transfinite by Zermelo, John von... (shrink)

In this article ideas from Kit Fine’s theory of arbitrary objects are applied to questions regarding mathematical structuralism. I discuss how sui generis mathematical structures can be viewed as generic systems of mathematical objects, where mathematical objects are conceived of as arbitrary objects in Fine’s sense.

This dissertation concerns the foundations of epistemic modality. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The dissertation demonstrates how phenomenal consciousness and gradational possible-worlds models in Bayesian perceptual psychology relate to epistemic modal space. The dissertation demonstrates, then, how epistemic modality relates to the computational theory of mind; metaphysical modality; deontic modality; logical modality; the types of mathematical modality; to the (...) epistemic status of undecidable propositions and abstraction principles in the philosophy of mathematics; to the apriori-aposteriori distinction; to the modal profile of rational propositional intuition; and to the types of intention, when the latter is interpreted as a modal mental state. Examining the nature of epistemic logic itself, I develop a novel approach to conditions of self-knowledge in the setting of the modal μ-calculus, as well as novel epistemicist solutions to Curry's, the liar, and the knowability paradoxes. Solutions to previously intransigent issues concerning the first-person concept; the distinction between fundamental and derivative truths; and the unity of intention and its role in decision theory, are developed along the way. (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.

Øystein Linnebo and Richard Pettigrew have recently developed a version of non-eliminative mathematical structuralism based on Fregean abstraction principles. They argue that their theory of abstract structures proves a consistent version of the structuralist thesis that positions in abstract structures only have structural properties. They do this by defining a subset of the properties of positions in structures, so-called fundamental properties, and argue that all fundamental properties of positions are structural. In this article, we argue that the structuralist thesis, even (...) when restricted to fundamental properties, does not follow from the theory of structures that Linnebo and Pettigrew have developed. To make their account work, we propose a formal framework in terms of Kripke models that makes structural abstraction precise. The formal framework allows us to articulate a revised definition of fundamental properties, understood as intensional properties. Based on this revised definition, we show that the restricted version of the structuralist thesis holds. 1Introduction 2The Structuralist Thesis 3LP-Structuralism 4Purity 5A Formal Framework for Structural Abstraction 6Fundamental Relations 7The Structuralist Thesis Vindicated 8Conclusion. (shrink)

Øystein Linnebo and Richard Pettigrew have recently developed a version of non-eliminative mathematical structuralism based on Fregean abstraction principles. They argue that their theory of abstract structures proves a consistent version of the structuralist thesis that positions in abstract structures only have structural properties. They do this by defining a subset of the properties of positions in structures, so-called fundamental properties, and argue that all fundamental properties of positions are structural. In this paper, we argue that the structuralist thesis, even (...) when restricted to fundamental properties, does not follow from the theory of structures that Linnebo and Pettigrew have developed. To make their account work, we propose a formal framework in terms of Kripke models that makes structural abstraction precise. The formal framework allows us to articulate a revised definition of fundamental properties, understood as intensional properties. Based on this revised definition, we show that the restricted version of the structuralist thesis holds. (shrink)

We contribute to the ongoing discussion on mathematical structuralism by focusing on a question that has so far been neglected: when is a structure part of another structure? This paper is a first step towards answering the question. We will show that a certain conception of structures, abstractionism about structures, yields a natural definition of the parthood relation between structures. This answer has many interesting consequences; however, it conflicts with some standard mereological principles. We argue that the tension between abstractionism (...) about structure and classical mereology is an interesting result and conclude that the mereology of abstract structures is a subject that deserves further exploration. We also point out some connections between our discussion of the mereology of structures and recent work on non-well-founded mereologies. (shrink)

In this paper, I describe and motivate a new species of mathematical structuralism, which I call Instrumental Nominalism about Set-Theoretic Structuralism. As the name suggests, this approach takes standard Set-Theoretic Structuralism of the sort championed by Bourbaki and removes its ontological commitments by taking an instrumental nominalist approach to that ontology of the sort described by Joseph Melia and Gideon Rosen. I argue that this avoids all of the problems that plague other versions of structuralism.

This paper develops a novel theory of abstraction—what we call collective abstraction. The theory solves a notorious problem for noneliminative structuralism. The noneliminative structuralist holds that in addition to various isomorphic systems there is a pure structure that can be abstracted from each of these systems; but existing accounts of abstraction fail for nonrigid systems like the complex numbers. The problem with the existing accounts is that they attempt to define a unique abstraction operation. The theory of collective abstraction instead (...) simultaneously defines a collection of distinct abstraction operations, each of which maps a system to its corresponding pure structure. The theory is precisely formulated in an essentialist language. This allows us to throw new light on the question to what extent structuralists are committed to symmetric dependence. Finally, we apply the theory of collective abstraction to solve a problem about converse relations. (shrink)

This is Part A of an article that defends non-eliminative structuralism about mathematics by means of a concrete case study: a theory of unlabeled graphs. Part A summarizes the general attractions of non-eliminative structuralism. Afterwards, it motivates an understanding of unlabeled graphs as structures sui generis and develops a corresponding axiomatic theory of unlabeled graphs. As the theory demonstrates, graph theory can be developed consistently without eliminating unlabeled graphs in favour of sets; and the usual structuralist criterion of identity can (...) be applied successfully in graph-theoretic proofs. Part B will turn to the philosophical interpretation and assessment of the theory. (shrink)

Informally, structural properties of mathematical objects are usually characterized in one of two ways: either as properties expressible purely in terms of the primitive relations of mathematical theories, or as the properties that hold of all structurally similar mathematical objects. We present two formal explications corresponding to these two informal characterizations of structural properties. Based on this, we discuss the relation between the two explications. As will be shown, the two characterizations do not determine the same class of mathematical properties. (...) From this observation we draw some philosophical conclusions about the possibility of a ‘correct’ analysis of structural properties. (shrink)

The paradox that appears under Burali-Forti’s name in many textbooks of set theory is a clever piece of reasoning leading to an unproblematic theorem. The theorem asserts that the ordinals do not form a set. For such a set would be—absurdly—an ordinal greater than any ordinal in the set of all ordinals. In this article, we argue that the paradox of Burali-Forti is first and foremost a problem about concept formation by abstraction, not about sets. We contend, furthermore, that some (...) hundred years after its discovery the paradox is still without any fully satisfactory resolution. A survey of the current literature reveals one key assumption of the paradox that has gone unquestioned, namely the assumption that ordinals are objects. Taking the lead from Russell’s no class theory, we interpret talk of ordinals as an efficient way of conveying higher-order logical truths. The resulting theory of ordinals is formally adequate to standard intuitions about ordinals, expresses a conception of ordinal number capable of resolving Burali-Forti’s paradox, and offers a novel contribution to the longstanding program of reducing mathematics to higher-order logic. (shrink)

Objects appear to fall into different sorts, each with their own criteria for identity. This raises the question of whether sorts overlap. Abstractionists about numbers—those who think natural numbers are objects characterized by abstraction principles—face an acute version of this problem. Many abstraction principles appear to characterize the natural numbers. If each abstraction principle determines its own sort, then there is no single subject-matter of arithmetic—there are too many numbers. That is, unless objects can belong to more than one sort. (...) But if there are multi-sorted objects, there should be cross-sortal identity principles for identifying objects across sorts. The going cross-sortal identity principle, ECIA2 of Cook and Ebert (2005), solves the problem of too many numbers. But, I argue, it does so at a high cost. I therefore propose a novel cross-sortal identity principle, based on embeddings of the induced models of abstracts developed by Walsh (2012). The new criterion matches ECIA2’s success, but offers interestingly different answers to the more controversial identifications made by ECIA2. (shrink)

Structuralism about mathematical objects and structuralist accounts of physical computation both face indeterminacy objections. For the former, the problem arises for cases such as the complex roots i and \, for which a automorphism can be defined, thus establishing the structural identity of these importantly distinct mathematical objects. In the case of the latter, the problem arises for logical duals such as AND and OR, which have invertible structural profiles :369–400, 2001). This makes their physical implementations indeterminate, in the sense (...) that their structural profiles alone cannot establish whether a given physical component is an AND-gate or an OR-gate. Doherty has recently shown both problems to be analogous, and has argued that computational structuralism is threatened with the absurd conclusion that computational digits might be indiscernible, such that, if structural properties are all that we have to go on, the binary digit 0 must be treated as identical to the binary digit 1. However, we think that a solution to the indiscernibility problem for mathematical structuralists, drawing on the work of David Hilbert, can be adapted for the analogous problem in the computational case, thereby rescuing the structuralist approach to physical computation. (shrink)

ABSTRACT This paper reveals David Hilbert’s position in the philosophy of mathematics, circa 1900, to be a form of non-eliminative structuralism, predating his formalism. I argue that Hilbert withstands the pressing objections put to him by Frege in the course of the Frege-Hilbert controversy in virtue of this early structuralist approach. To demonstrate that this historical position deserves contemporary attention I show that Hilbertian structuralism avoids a recent wave of objections against non-eliminative structuralists to the effect that they cannot distinguish (...) between structurally identical but importantly distinct mathematical objects, such as the complex roots of $-1$. (shrink)

Platonists affirm the existence of abstract mathematical objects, and Nominalists deny the existence of abstract mathematical objects. While there are standard arguments in favor of Nominalism, these arguments fail to account for the necessity of Nominalism. Furthermore, these arguments do nothing to explain why Nominalism is true. They only point to certain theoretical vices that might befall the Platonist. The goal of this paper is to formulate and defend a simple, valid argument for the necessity of Nominalism that seeks to (...) precisify the widespread intuition that mathematical objects are somehow ‘spooky’ or ‘mysterious’. (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)

This paper aims to vindicate the thesis that cognitive computational properties are abstract objects implemented in physical systems. I avail of the equivalence relations countenanced in Homotopy Type Theory, in order to specify an abstraction principle for epistemic intensions. The homotopic abstraction principle for epistemic intensions provides an epistemic conduit into our knowledge of intensions as abstract objects. I examine, then, how intensional functions in Epistemic Modal Algebra are deployed as core models in the philosophy of mind, Bayesian perceptual psychology, (...) and the program of natural language semantics in linguistics, and I argue that this provides abductive support for the truth of homotopic abstraction. Epistemic modality can thus be shown to be both a compelling and a materially adequate candidate for the fundamental structure of mental representational states, comprising a fragment of the Language of Thought. (shrink)

One of the important discussions in the philosophy of mathematics, is that centered on Benacerraf’s Dilemma. Benacerraf’s dilemma challenges theorists to provide an epistemology and semantics for mathematics, based on their favourite ontology. This challenge is the point on which all philosophies of mathematics are judged, and clarifying how we might acquire mathematical knowledge is one of the main occupations of philosophers of mathematics. In this thesis I argue that this discussion has overlooked an important part of mathematics, namely mathematics (...) as it is exercised by ordinary people. I do so by looking at the different theories that have been put forward in the recent debate, and showing for each of these that they are unable to account for the mathematical practices of ordinary people. In order to show that these practices do need to be accounted for, I also argue that ordinary people are doing mathematics, i.e. that they engage in properly mathematical practices. Because these practices are properly mathematical, they should be accounted for by any philosophy of mathematics. The conclusion of my thesis, then, is that current theories fail to do something that they should do, while remaining neutral on how well they perform when it comes to accounting for the practices of professional mathematicians. (shrink)

This work is a conceptual analysis of certain recent developments in the mathematical foundations of Classical and Quantum Mechanics which have allowed to formulate both theories in a common language. From the algebraic point of view, the set of observables of a physical system, be it classical or quantum, is described by a Jordan-Lie algebra. From the geometric point of view, the space of states of any system is described by a uniform Poisson space with transition probability. Both these structures (...) are here perceived as formal translations of the fundamental twofold role of properties in Mechanics: they are at the same time quantities and transformations. The question becomes then to understand the precise articulation between these two roles. The analysis will show that Quantum Mechanics can be thought as distinguishing itself from Classical Mechanics by a compatibility condition between properties-as-quantities and properties-as-transformations. -/- Moreover, this dissertation shows the existence of a tension between a certain "abstract way" of conceiving mathematical structures, used in the practice of mathematical physics, and the necessary capacity to specify particular states or observables. It then becomes important to understand how, within the formalism, one can construct a labelling scheme. The “Chase for Individuation” is the analysis of different mathematical techniques which attempt to overcome this tension. In particular, we discuss how group theory furnishes a partial solution. (shrink)