This paper is an exposition and evaluation of the Agustín Rayo's views about the epistemology and metaphysics of mathematics, as they are presented in his book The Construction of Logical Space.

This study looks to the work of Tarski's mentors Stanislaw Lesniewski and Tadeusz Kotarbinski, and reconsiders all of the major issues in Tarski scholarship in light of the conception of Intuitionistic Formalism developed: semantics, truth, paradox, logical consequence.

Why should one think Frege's definition of the ancestral correct? It can be proven to be extensionally correct, but the argument uses arithmetical induction, and that seems to undermine Frege's claim to have justified induction in purely logical terms. I discuss such circularity objections and then offer a new definition of the ancestral intended to be intensionally correct; its extensional correctness then follows without proof. This new definition can be proven equivalent to Frege's without any use of arithmetical induction. This (...) proves, without any use of arithmetical induction, that Frege's definition is extensionally correct and so answers the circularity objections. (shrink)

Computational complexity theory is a subfield of computer science originating in computability theory and the study of algorithms for solving practical mathematical problems. Amongst its aims is classifying problems by their degree of difficulty — i.e., how hard they are to solve computationally. This paper highlights the significance of complexity theory relative to questions traditionally asked by philosophers of mathematics while also attempting to isolate some new ones — e.g., about the notion of feasibility in mathematics, the $\mathbf{P} \neq \mathbf{NP}$ (...) problem and why it has proven hard to resolve, and the role of non-classical modes of computation and proof. (shrink)

This is the most comprehensive book ever published on philosophical methodology. A team of thirty-eight of the world's leading philosophers present original essays on various aspects of how philosophy should be and is done. The first part is devoted to broad traditions and approaches to philosophical methodology. The entries in the second part address topics in philosophical methodology, such as intuitions, conceptual analysis, and transcendental arguments. The third part of the book is devoted to essays about the interconnections between philosophy (...) and neighbouring fields, including those of mathematics, psychology, literature and film, and neuroscience. (shrink)

We investigate the philosophical significance of the existence of different semantic systems with respect to which a given deductive system is sound and complete. Our case study will be Corcoran's deductive system D for Aristotelian syllogistic and some of the different semantic systems for syllogistic that have been proposed in the literature. We shall prove that they are not equivalent, in spite of D being sound and complete with respect to each of them. Beyond the specific case of syllogistic, the (...) goal is to offer a general discussion of the relations between informal notions—in this case, an informal notion of deductive validity—and logical apparatuses such as deductive systems and (model-theoretic or other) semantic systems that aim at offering technical, formal accounts of informal notions. Specifically, we will be interested in Kreisel's famous 'squeezing argument'; we shall ask ourselves what a plurality of semantic systems (understood as classes of mathematical structures) may entail for the cogency of specific applications of the squeezing argument. More generally, the analysis brings to the fore the need for criteria of adequacy for semantic systems based on mathematical structures. Without such criteria, the idea that the gap between informal and technical accounts of validity can be bridged is put under pressure. (shrink)

If mathematics is regarded as a science, then the philosophy of mathematics can be regarded as a branch of the philosophy of science, next to disciplines such as the philosophy of physics and the philosophy of biology. However, because of its subject matter, the philosophy of mathematics occupies a special place in the philosophy of science. Whereas the natural sciences investigate entities that are located in space and time, it is not at all obvious that this is also the case (...) with respect to the objects that are studied in mathematics. In addition to that, the methods of investigation of mathematics differ markedly from the methods of investigation in the natural sciences. Whereas the latter acquire general knowledge using inductive methods, mathematical knowledge appears to be acquired in a different way, namely, by deduction from basic principles. The status of mathematical knowledge also appears to differ from the status of knowledge in the natural sciences. The theories of the natural sciences appear to be less certain and more open to revision than mathematical theories. For these reasons mathematics poses problems of a quite distinctive kind for philosophy. Therefore philosophers have accorded special attention to ontological and epistemological questions concerning mathematics. (shrink)

Ranging from Alan Turing’s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer’s solipsistic attitude to logic, there remain points of disagreement to this day. Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the (...) developments following Turing’s ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics. This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability’s adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic. (shrink)

Plural expressions found in natural languages allow us to talk about many objects simultaneously. Plural logic — a logical system that takes plurals at face value — has seen a surge of interest in recent years. This book explores its broader significance for philosophy, logic, and linguistics. What can plural logic do for us? Are the bold claims made on its behalf correct? After introducing plural logic and its main applications, the book provides a systematic analysis of the relation between (...) this logic and other theoretical frameworks such as set theory, mereology, higher-order logic, and modal logic. The applications of plural logic rely on two assumptions, namely that this logic is ontologically innocent and has great expressive power. These assumptions are shown to be problematic. The result is a more nuanced picture of plural logic's applications than has been given thus far. Questions about the correct logic of plurals play a central role in the final chapters, where traditional plural logic is rejected in favor of a "critical" alternative. The most striking feature of this alternative is that there is no universal plurality. This leads to a novel approach to the relation between the many and the one. In particular, critical plural logic paves the way for an account of sets capable of solving the set-theoretic paradoxes. (shrink)

Logical form has always been a prime concern for philosophers belonging to the analytic tradition. For at least one century, the study of logical form has been widely adopted as a method of investigation, relying on its capacity to reveal the structure of thoughts or the constitution of facts. This book focuses on the very idea of logical form, which is directly relevant to any principled reflection on that method. Its central thesis is that there is no such thing as (...) a correct answer to the question of what is logical form: two significantly different notions of logical form are needed to fulfil two major theoretical roles that pertain respectively to logic and to semantics. This thesis has a negative and a positive side. The negative side is that a deeply rooted presumption about logical form turns out to be overly optimistic: there is no unique notion of logical form that can play both roles. The positive side is that the distinction between two notions of logical form, once properly spelled out, sheds light on some fundamental issues concerning the relation between logic and language. (shrink)

This comment focuses on Chapter 9 of The Boundary Stones of Thought and the argument, due to William Tait, that Ian Rumfitt there sustains for the indeterminacy of set. I argue that Michael Dummett’s argument, based on the notion of indefinite extensibility and set aside by Rumfitt, provides a more powerful basis for the same conclusion. In addition, I outline two difficulties for the way Rumfitt attempts to save classical logic from acknowledged failures of the principle of bivalence, one specifically (...) for his treatment of the set-theoretic case, the other of more general bearing but especially germane to the case of vagueness. (shrink)

This paper discusses the relevance of supertask computation for the determinacy of arithmetic. Recent work in the philosophy of physics has made plausible the possibility of supertask computers, capable of running through infinitely many individual computations in a finite time. A natural thought is that, if supertask computers are possible, this implies that arithmetical truth is determinate. In this paper we argue, via a careful analysis of putative arguments from supertask computations to determinacy, that this natural thought is mistaken: supertasks (...) are of no help in explaining arithmetical determinacy. (shrink)

We introduce constructive and classical systems for nonstandard arithmetic and show how variants of the functional interpretations due to Gödel and Shoenfield can be used to rewrite proofs performed in these systems into standard ones. These functional interpretations show in particular that our nonstandard systems are conservative extensions of E-HAω and E-PAω, strengthening earlier results by Moerdijk and Palmgren, and Avigad and Helzner. We will also indicate how our rewriting algorithm can be used for term extraction purposes. To conclude the (...) paper, we will point out some open problems and directions for future research, including some initial results on saturation principles. (shrink)

Ontological pluralism is the doctrine that there are different ways or modes of being. In contemporary guise, it is the doctrine that a logically perspicuous description of reality will use multiple quantifiers which cannot be thought of as ranging over a single domain. Although thought defeated for some time, recent defenses have shown a number of arguments against the view unsound. However, another worry looms: that despite looking like an attractive alternative, ontological pluralism is really no different than its counterpart, (...) ontological monism. In this paper, after explaining the worry in detail, I argue that considerations dealing with the nature of the logic ontological pluralists ought to endorse, coupled with an attractive philosophical thesis about the relationship between logic and metaphysics, show this worry to be unfounded. (shrink)

Take a formula of first-order logic which is a logical consequence of some other formulae according to model theory, and in all those formulae replace schematic letters with English expressions. Is the argument resulting from the replacement valid in the sense that the premisses could not have been true without the conclusion also being true? Can we reason from the model-theoretic concept of logical consequence to the modal concept of validity? Yes, if the model theory is the standard one for (...) sentential logic; no, if it is the standard one for the predicate calculus; and yes, if it is a certain model theory for free logic. These conclusions rely inter alia on some assumptions about possible worlds, which are mapped into the models of model theory. Plural quantification is used in the last section, while part of the reasoning is relegated to an appendix that includes a proof of completeness for a version of free logic. (shrink)

Since virtually every mathematical theory can be interpreted in set theory, the latter is a foundation for mathematics. Whether set theory, as opposed to any of its rivals, is the right foundation for mathematics depends on what a foundation is for. One purpose is philosophical, to provide the metaphysical basis for mathematics. Another is epistemic, to provide the basis of all mathematical knowledge. Another is to serve mathematics, by lending insight into the various fields. Another is to provide an arena (...) for exploring relations and interactions between mathematical fields, their relative strengths, etc. Given the different goals, there is little point to determining a single foundation for all of mathematics. (shrink)

Many of our concepts are introduced to us via, and seem only to be constrained by, roughand-ready explanations and some sample paradigm positive and negative applications. This happens even in informal logic and mathematics. Yet in some cases, the concepts in question – although only informally and vaguely characterized – in fact have, or appear to have, entirely determinate extensions. Here’s one familiar example. When we start learning computability theory, we are introduced to the idea of an algorithmically computable function (...) (from numbers to numbers) – i.e. one whose value for any given input can be determined by a step-by-step calculating procedure, where each step is fully determined by some antecedently given finite set of calculating rules. We are told that we are to abstract from practical considerations of how many steps will be needed and how much ink will be spilt in the process, so long as everything remains finite. We are also told that each step is to be ‘small’ and the rules governing it must be ‘simple’, available to a cognitively limited calculating agent: for we want an algorithmic procedure, step-by-minimal-step, to be idiot-proof. For a classic elucidation of this kind, see e.g. Rogers (1967, pp. 1–5). Church’s Thesis, in one form, then claims this informally explicated concept in fact has a perfectly precise extension, the set of recursive functions. Church’s Thesis can be supported in a quasi-empirical way, by the failure of our searches for counterexamples. It can be supported too in a more principled way, by the observation that different appealing ways of sharpening up the informal chararacterization of algorithmic computability end up specifying the same set of recursive functions. But such considerations fall short of a demonstration of the Thesis. So is there a different argumentative strategy we could use, one that could lead to a proof? Sometimes it is claimed that there just can’t be, because you can never really prove results involving an informal concept like algorithmic computability.. (shrink)

Using Carnap’s concept explication, we propose a theory of concept formation in mathematics. This theory is then applied to the problem of how to understand the relation between the concepts formal proof and informal, mathematical proof.

The purpose of this note is to examine the relationship between the practice of mathematics and the philosophy of mathematics, ontology in particular. One conclusion is that the enterprises are (or should be) closely related, with neither one dominating the other. One cannot 'read off' the correct way to do mathematics from the true ontology, for example, nor can one ‘read off’ the true ontology from mathematics as practiced.

Call a quantifier ‘unrestricted’ if it ranges over absolutely all objects. Arguably, unrestricted quantification is often presupposed in philosophical inquiry. However, developing a semantic theory that vindicates unrestricted quantification proves rather difficult, at least as long as we formulate our semantic theory within a classical first-order language. It has been argued that using a type theory as framework for our semantic theory provides a resolution of this problem, at least if a broadly Fregean interpretation of type theory is assumed. However, (...) the intelligibility of this interpretation has been questioned. In this paper I introduce a type-free theory of properties that can also be used to vindicate unrestricted quantification. This alternative emerges very naturally by reflecting on the features on which the type-theoretic solution of the problem of unrestricted quantification relies. Although this alternative theory is formulated in a non-classical logic, it preserves the deductive strength of classical strict type theory in a natural way. The ideas developed in this paper make crucial use of Russell’s notion of range of significance. (shrink)

On the basis of a wide range of historical examples various features of axioms are discussed in relation to their use in mathematical practice. A very general framework for this discussion is provided, and it is argued that axioms can play many roles in mathematics and that viewing them as self-evident truths does not do justice to the ways in which mathematicians employ axioms. Possible origins of axioms and criteria for choosing axioms are also examined. The distinctions introduced aim at (...) clarifying discussions in philosophy of mathematics and contributing towards a more refined view of mathematical practice. (shrink)

In this paper, I develop a view on set-theoretic ontology I call Universe-Indeterminism, according to which there is a unique but indeterminate universe of sets. I argue that Solomon Feferman’s work on semi-constructive set theories can be adapted to this project, and develop a philosophical motivation for a semi-constructive set theory closely based on Feferman’s but tailored to the Universe-Indeterminist’s viewpoint. I also compare the emergent Universe-Indeterminist view to some more familiar views on set-theoretic ontology.

The aim of this essay is to show that the subject-matter of ontology is richer than one might have thought. Our route will be indirect. We will argue that there are circumstances under which standard first-order regimentation is unacceptable, and that more appropriate varieties of regimentation lead to unexpected kinds of ontological commitment.

There is little doubt that a second-order axiomatization of Zermelo-Fraenkel set theory plus the axiom of choice (ZFC) is desirable. One advantage of such an axiomatization is that it permits us to express the principles underlying the first-order schemata of separation and replacement. Another is its almost-categoricity: M is a model of second-order ZFC if and only if it is isomorphic to a model of the form Vκ, ∈ ∩ (Vκ × Vκ) , for κ a strongly inaccessible ordinal.

Forthcoming in Philosophical Compass. I explain why plural quantifiers and predicates have been thought to be philosophically significant.

In his recent book, Quine, New Foundations, and the Philosophy of Set Theory, Sean Morris attempts to rehabilitate Quine’s NF as a possible foundation for mathematics. I explain why he does not succeed.

The paper presents an argument against a "metaphysical" conception of logic according to which logic spells out a specific kind of mathematical structure that is somehow inherently related to our factual reasoning. In contrast, it is argued that it is always an empirical question as to whether a given mathematical structure really does captures a principle of reasoning. (More generally, it is argued that it is not meaningful to replace an empirical investigation of a thing by an investigation of its (...) a priori analyzable structure without paying due attention to the question of whether it really is the structure of the thing in question.) It is proposed to elucidate the situation by distinguishing two essentially different realms with which our reason must deal: "the realm of the natural", constituted by the things of our empirical world, and "the realm of the formal", constituted by the structures that we use as "prisms" to view, to make sense of, and to reconstruct the world. It is suggested that this vantage point may throw light on many foundational problems of logic. (shrink)

Doing Worlds with Words throws light on the problem of meaning as the meeting point of linguistics, logic and philosophy, and critically assesses the possibilities and limitations of elucidating the nature of meaning by means of formal logic, model theory and model-theoretical semantics. The main thrust of the book is to show that it is misguided to understand model theory metaphysically and so to try to base formal semantics on something like formal metaphysics; rather, the book states that model theory (...) and similar tools of the analysis of language should be understood as capturing the semantically relevant, especially inferential, structure of language. From this vantage point, the reader gains a new light on many of the traditional concepts and problems of logic and philosophy of language, such as meaning, reference, truth and the nature of formal logic. (shrink)

The overgeneration argument attempts to show that accepting second-order validity as a sound formal counterpart of logical truth has the unacceptable consequence that the Continuum Hypothesis is either a logical truth or a logical falsehood. The argument was presented and vigorously defended in John Etchemendy’s The Concept of Logical Consequence and it has many proponents to this day. Yet it is nothing but a seductive fallacy. I demonstrate this by considering five versions of the argument; as I show, each is (...) either unsound or lacks a troubling conclusion. (shrink)

Semantics connected to some information based metaphor are well-known in logic literature: a paradigmatic example is Kripke semantic for Intuitionistic Logic. In this paper we start from the concrete problem of providing suitable logic-algebraic models for the calculus of attribute dependencies in Formal Contexts with information gaps and we obtain an intuitive model based on the notion of passage of information showing that Kleene algebras, semi-simple Nelson algebras, three-valued ukasiewicz algebras and Post algebras of order three are, in a sense, (...) naturally and directly connected to partially defined information systems. In this way wecan provide for these logic-algebraic structures a raison dêetre different from the original motivations concerning, for instance, computability theory. (shrink)

Brouwer's papers after 1945 are characterized by a technique known as the method of the creating subject. It has been supposed that the method was radically new in his work, since Brouwer seems to introduce an idealized mathematician into his mathematical practice. A newly opened source, the unpublished text of a lecture of Brouwer from 1934, fully supports the conclusions of our analysis that: - There is no idealized mathematician involved in the method;- The method was not new at all;- (...) Brouwer uses an incomplete sequence, also known as choice sequence, in this method, which is special. The method does not take its place in the standard works on choice sequences. (shrink)

Tarski's Undefinability of Truth Theorem comes in two versions: that no consistent theory which interprets Robinson's Arithmetic (Q) can prove all instances of the T-Scheme and hence define truth; and that no such theory, if sound, can even express truth. In this note, I prove corresponding limitative results for validity. While Peano Arithmetic already has the resources to define a predicate expressing logical validity, as Jeff Ketland has recently pointed out (2012, Validity as a primitive. Analysis 72: 421-30), no theory (...) which interprets Q closed under the standard structural rules can define nor express validity, on pain of triviality. The results put pressure on the widespread view that there is an asymmetry between truth and validity, viz. that while the former cannot be defined within the language, the latter can. I argue that Vann McGee's and Hartry Field's arguments for the asymmetry view are problematic. (shrink)

Recent work on formal theories of truth has revived an approach, due originally to Tarski, on which syntax and truth theories are sharply distinguished—‘disentangled’—from mathematical base theories. In this paper, we defend a novel philosophical constraint on disentangled theories. We argue that these theories must be epistemically stable: they must possess an intrinsic motivation justifying no strictly stronger theory. In a disentangled setting, even if the base and the syntax theory are individually stable, they may be jointly unstable. We contend (...) that this flaw afflicts many proposals discussed in the literature; we defend a new, stable disentangled theory, double second-order arithmetic. (shrink)

This paper critically examines two arguments against the generic multiverse, both of which are due to W. Hugh Woodin. Versions of the first argument have appeared a number of times in print, while the second argument is relatively novel. We shall investigate these arguments through the lens of two different attitudes one may take toward the methodology and metaphysics of set theory; and we shall observe that the impact of these arguments depends significantly on which of these attitudes is upheld. (...) Our examination of the second argument involves the development of a new model for Steel’s multiverse theory, which is delivered in the Appendix. (shrink)

There is no preferred reduction of number theory to set theory. Nonetheless, we confidently accept axioms obtained by substituting formulas from the language of set theory into the induction axiom schema. This is only possible, it is argued, because our acceptance of the induction axioms depends solely on the meanings of aritlunetical and logical terms, which is only possible if our 'intended models' of number theory are standard. Similarly, our acceptance of the second-order natural deduction rules depends solely on the (...) meanings of the logical terms, which implies, it is argued, that our second-order quantifiers have to be standard. (shrink)

The aim of this paper is to provide epistemic reasons for investigating the notions of informal rigour and informal provability. I argue that the standard view of mathematical proof and rigour yields an implausible account of mathematical knowledge, and falls short of explaining the success of mathematical practice. I conclude that careful consideration of mathematical practice urges us to pursue a theory of informal provability.

Are there genuine mathematical explanations of physical phenomena, and if so, how can mathematical theories, which are typically thought to concern abstract mathematical objects, explain contingent empirical matters? The answer, I argue, is in seeing an important range of mathematical explanations as structural explanations, where structural explanations explain a phenomenon by showing it to have been an inevitable consequence of the structural features instantiated in the physical system under consideration. Such explanations are best cast as deductive arguments which, by virtue (...) of their form, establish that, given the mathematical structure instantiated in the physical system under consideration, the explanandum had to occur. Against the claims of platonists such as Alan Baker and Mark Colyvan, I argue that formulating mathematical explanations as structural explanations in this way shows that we can accept that mathematics can play an indispensable explanatory role in empirical science without committing to the existence of any abstract mathematical objects. (shrink)

This paper investigates the relation between Carnap and Quine’s views on analyticity on the one hand, and their views on philosophical analysis or explication on the other. I argue that the stance each takes on what constitutes a successful explication largely dictates the view they take on analyticity. I show that although acknowledged by neither party (in fact Quine frequently expressed his agreement with Carnap on this subject) their views on explication are substantially different. I argue that this difference not (...) only explains their differences on the question of analyticity, but points to a Quinean way to answer a challenge that Quine posed to Carnap. The answer to this challenge leads to a Quinean view of analyticity such that arithmetical truths are analytic, according to Quine’s own remarks, and set theory is at least defensibly analytic. (shrink)