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.

This paper explores the relationship between Hume's Prinicple and Basic Law V, investigating the question whether we really do need to suppose that, already in Die Grundlagen, Frege intended that HP should be justified by its derivation from Law V.

In this paper I examine the prospects for a successful neo–logicist reconstruction of the real numbers, focusing on Bob Hale's use of a cut-abstraction principle. There is a serious problem plaguing Hale's project. Natural generalizations of this principle imply that there are far more objects than one would expect from a position that stresses its epistemological conservativeness. In other words, the sort of abstraction needed to obtain a theory of the reals is rampantly inflationary. I also indicate briefly why this (...) problem is likely to reappear in any neo–logicist reconstruction of real analysis. (shrink)

Tarski's analysis of the concept of truth gives rise to a hierarchy of languages. Does this fragment the concept all the way to philosophical unacceptability? I argue it doesn't, drawing on a modification of Kaplan's theory of indexicals.

This article surveys recent literature by Parsons, McGee, Shapiro and others on the significance of categoricity arguments in the philosophy of mathematics. After discussing whether categoricity arguments are sufficient to secure reference to mathematical structures up to isomorphism, we assess what exactly is achieved by recent ‘internal’ renditions of the famous categoricity arguments for arithmetic and set theory.

Informal rigour is the process by which we come to understand particular mathematical structures and then manifest this rigour through axiomatisations. Structural relativity is the idea that the kinds of structures we isolate are dependent upon the logic we employ. We bring together these ideas by considering the level of informal rigour exhibited by our set-theoretic discourse, and argue that different foundational programmes should countenance different underlying logics (intermediate between first- and second-order) for formulating set theory. By bringing considerations of (...) perturbations in modal space to bear on the debate, we will suggest that a promising option for representing current set-theoretic thought is given by formulating set theory using quasi-weak second-order logic. These observations indicate that the usual division of structures into \particular (e.g. the natural number structure) and general (e.g. the group structure) is perhaps too coarse grained; we should also make a distinction between intentionally and unintentionally general structures. (shrink)

This paper presents a systematic study of the prehistory of the traditional subsystems of second-order arithmetic that feature prominently in the reverse mathematics program of Friedman and Simpson. We look in particular at: (i) the long arc from Poincar\'e to Feferman as concerns arithmetic definability and provability, (ii) the interplay between finitism and the formalization of analysis in the lecture notes and publications of Hilbert and Bernays, (iii) the uncertainty as to the constructive status of principles equivalent to Weak K\"onig's (...) Lemma, and (iv) the large-scale intellectual backdrop to arithmetical transfinite recursion in descriptive set theory and its effectivization by Borel, Lusin, Addison, and others. (shrink)

Computationalism holds that our grasp of notions like ‘computable function’ can be used to account for our putative ability to refer to the standard model of arithmetic. Tennenbaum's Theorem has been repeatedly invoked in service of this claim. I will argue that not only do the relevant class of arguments fail, but that the result itself is most naturally understood as having the opposite of a reference-fixing effect — i.e., rather than securing the determinacy of number-theoretic reference, Tennenbaum's Theorem points (...) towards a sense in which portions of our computational vocabulary should be regarded as model-relative. (shrink)

The Knowability Paradox purports to show that the controversial but not patently absurd hypothesis that all truths are knowable entails the implausible conclusion that all truths are known. The notoriety of this argument owes to the negative light it appears to cast on the view that there can be no verification-transcendent truths. We argue that it is overly simplistic to formalize the views of contemporary verificationists like Dummett, Prawitz or Martin-Löf using the sort of propositional modal operators which are employed (...) in the original derivation of the Paradox. Instead we propose that the central tenet of verificationism is most accurately formulated as follows: if φ is true, then there exists a proof of φ Building on the work of Artemov (Bull Symb Log 7(1): 1-36, 2001), a system of explicit modal logic with proof quantifiers is introduced to reason about such statements. When the original reasoning of the Paradox is developed in this setting, we reach not a contradiction, but rather the conclusion that there must exist non-constructed proofs. This outcome is evaluated relative to the controversy between Dummett and Prawitz about proof existence and bivalence. (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)

In this article I present a theory of what it is to be fair. I take my cue from Broome’s well known 1990 account of fairness. Broome’s basic thesis is that fairness is the proportional satisfaction of claims, and with this I am in at least partial agreement. But neither Broome nor anyone else (so far as I know) has laid down a theory of precisely what one must do in order to be fair. The theory offered here does just (...) this. (shrink)

After a brief discussion of Kreisel’s notion of informal rigour and Myhill’s notion of absolute proof, Gödel’s analysis of the subject is presented. It is shown how Gödel avoids the notion of informal proof because such a use would contradict one of the senses of “formal” that Gödel wants to preserve. This Gödelian notion of “formal” is directly tied to his notion of absolute proof and to the question of the general applicability of concepts, in a way that overcomes both (...) Kreisel and Myhill’s conceptions. This paper aims to contribute to the present-day debate on informal and epistemic mathematics, focusing on what appears necessary for a better understanding of the issues at stake. (shrink)

After a short preface, the first of the three sections of this paper is devoted to historical and philosophic aspects of categoricity. The second section is a self-contained exposition, including detailed definitions, of a proof that every mathematical system whose domain is the closure of its set of distinguished individuals under its distinguished functions is categorically characterized by its induction principle together with its true atoms (atomic sentences and negations of atomic sentences). The third section deals with applications especially those (...) involving the distinction between characterizing a system and axiomatizing the truths of a system. (shrink)

In “Properties and the Interpretation of Second-Order Logic” Bob Hale develops and defends a deflationary conception of properties where a property with particular satisfaction conditions actually exists if and only if it is possible that a predicate with those same satisfaction conditions exists. He argues further that, since our languages are finitary, there are at most countably infinitely many properties and, as a result, the account fails to underwrite the standard semantics for second-order logic. Here a more lenient version of (...) the view is explored, which allows for the possibility of countably infinite predicates understood as the product of linguistic supertasks. This enriched deflationist account of properties—the Infinitary Deflationary Conception of Existence—supports the standard semantics for models with countable first-order domains, and allows one to prove the categoricity of the second-order Peano axioms. (shrink)

Two topics figure prominently in recent discussions of mathematical structuralism: challenges to the purported metaphysical insight provided by sui generis structuralism and the significance of category theory for understanding and articulating mathematical structuralism. This article presents an overview of central themes related to these topics.

Owen Griffiths has recently argued that Etchemendy’s account of logical consequence faces a dilemma. Etchemendy claims that we can be sure that his account does not overgenerate, but that we should expect it to undergenerate. Griffiths argues that if we define the relationship between formal and natural language as being dependent on logical consequence, then Etchemendy’s claims are not true; and if we define the relationship as being independent of logical consequence, then we cannot assess the truth of the claims (...) without further information. I argue that Griffiths misconstrues Etchemendy’s theory and overstates the first horn of the dilemma: Etchemendy does see the relationship as being dependent on logical consequence, but that does not mean that his claims are not true. (shrink)

Putnam’s most famous contribution to mathematical logic was his role in investigating Hilbert’s Tenth Problem; Putnam is the ‘P’ in the MRDP Theorem. This volume, though, focusses mostly on Putnam’s work on the philosophy of logic and mathematics. It is a somewhat bumpy ride. Of the twelve papers, two scarcely mention Putnam. Three others focus primarily on Putnam’s ‘Mathematics without foundations’ (1967), but with no interplay between them. The remaining seven papers apparently tackle unrelated themes. Some of this disjointedness would (...) doubtless have been addressed, if Putnam had been able to compose his replies to these papers; sadly, he died before this was possible. In this review, I do my best to tease out some connections between the paper; and there are some really interesting connections to be made. (shrink)

A new axiomatization of set theory, to be called Bernays-Boolos set theory, is introduced. Its background logic is the plural logic of Boolos, and its only positive set-theoretic existence axiom is a reflection principle of Bernays. It is a very simple system of axioms sufficient to obtain the usual axioms of ZFC, plus some large cardinals, and to reduce every question of plural logic to a question of set theory.

Arguments to the effect that Church's thesis is intrinsically unprovable because proof cannot relate an informal, intuitive concept to a mathematically defined one are unconvincing, since other 'theses' of this kind have indeed been proved, and Church's thesis has been proved in one direction. However, though evidence for the truth of the thesis in the other direction is overwhelming, it does not yet amount to proof.

This paper examines the connection between model-theoretic truth and necessary truth. It is argued that though the model-theoretic truths of some standard languages are demonstrably ''''necessary'''' (in a precise sense), the widespread view of model-theoretic truth as providing a general guarantee of necessity is mistaken. Several arguments to the contrary are criticized.

I make an attempt at the description of the delicate role of the standard model of arithmetic for the syntax of formal systems. I try to assess whether the possible instability in the notion of finiteness deriving from the nonstandard interpretability of arithmetic affects the very notions of syntactic metatheory and of formal system. I maintain that the crucial point of the whole question lies in the evaluation of the phenomenon of formalization. The ideas of Skolem, Zermelo, Beth and Carnap (...) (among others) on the problem are discussed. ‘A tries to explain to B the meaning of negation. Finally A gives up, saying: “You don’t understand what I mean, and I am not going to explain any longer,” to which B replies: “Yes, I see what you mean, and I am glad you are willing to continue your explanations”’. G. Mannoury, reported by E. W. Beth (Beth, 1963, 489). (shrink)

Consequence is at the heart of logic; an account of consequence, of what follows from what, offers a vital tool in the evaluation of arguments. Since philosophy itself proceeds by way of argument and inference, a clear view of what logical consequence amounts to is of central importance to the whole discipline. In this book JC Beall and Greg Restall present and defend what thay call logical pluralism, the view that there is more than one genuine deductive consequence relation, a (...) position which has profound implications for many linguists as well as for philosophers. We should not search for one true logic, since there are many. (shrink)

Consequence is at the heart of logic; an account of consequence, of what follows from what, offers a vital tool in the evaluation of arguments. Since philosophy itself proceeds by way of argument and inference, a clear view of what logical consequence amounts to is of central importance to the whole discipline. In this book JC Beall and Greg Restall present and defend what thay call logical pluralism, the view that there is more than one genuine deductive consequence relation, a (...) position which has profound implications for many linguists as well as for philosophers. We should not search for one true logic, since there are many. (shrink)

In different papers, Carnielli, W. & Rodrigues, A., Carnielli, W. Coniglio, M. & Rodrigues, A. and Rodrigues & Carnielli, present two logics motivated by the idea of capturing contradictions as conflicting evidence. The first logic is called BLE and the second—that is a conservative extension of BLE—is named LETJ. Roughly, BLE and LETJ are two non-classical logics in which the Laws of Explosion and Excluded Middle are not admissible. LETJ is built on top of BLE. Moreover, LETJ is a Logic (...) of Formal Inconsistency. This means that there is an operator that, roughly speaking, identifies a formula as having classical behavior. Both systems are motivated by the idea that there are different conditions for accepting or rejecting a sentence of our natural language. So, there are some special introduction and elimination rules in the theory that are capturing different conditions of use. Rodrigues & Carnielli’s paper has an interesting and challenging idea. According to them, BLE and LETJ are incompatible with dialetheia. It seems to show that these paraconsistent logics cannot be interpreted using truth-conditions that allow true contradictions. In short, BLE and LETJ talk about conflicting evidence avoiding to talk about gluts. I am going to argue against this point of view. Basically, I will firstly offer a new interpretation of BLE and LETJ that is compatible with dialetheia. The background of my position is to reject the one canonical interpretation thesis: the idea according to which a logical system has one standard interpretation. Then, I will secondly show that there is no logical basis to fix that Rodrigues & Carnielli’s interpretation is the canonical way to establish the content of logical notions of BLE and LETJ. Furthermore, the system LETJ captures inside classical logic. Then, I am also going to use this technical result to offer some further doubts about the one canonical interpretation thesis. (shrink)

A response is given here to Benacerraf's (1965) non-uniqueness (or multiple-reductions) objection to mathematical platonism. It is argued that non-uniqueness is simply not a problem for platonism; more specifically, it is argued that platonists can simply embrace non-uniqueness—i.e., that one can endorse the thesis that our mathematical theories truly describe collections of abstract mathematical objects while rejecting the thesis that such theories truly describe unique collections of such objects. I also argue that part of the motivation for this stance is (...) that it dovetails with the correct response to Benacerraf's other objection to platonism, i.e., his (1973) epistemological objection. (shrink)

A response is given here to Benacerraf's 1973 argument that mathematical platonism is incompatible with a naturalistic epistemology. Unlike almost all previous platonist responses to Benacerraf, the response given here is positive rather than negative; that is, rather than trying to find a problem with Benacerraf's argument, I accept his challenge and meet it head on by constructing an epistemology of abstract (i.e., aspatial and atemporal) mathematical objects. Thus, I show that spatio-temporal creatures like ourselves can attain knowledge about mathematical (...) objects by simply explaininghow they can do this. My argument is based upon the adoption of a particular version of platonism — full-blooded platonism — which asserts that any mathematical object which possiblycould exist actuallydoes exist. (shrink)

In this paper the logic of broad necessity is explored. Definitions of what it means for one modality to be broader than another are formulated, and it is proven, in the context of higher-order logic, that there is a broadest necessity, settling one of the central questions of this investigation. It is shown, moreover, that it is possible to give a reductive analysis of this necessity in extensional language. This relates more generally to a conjecture that it is not possible (...) to define intensional connectives from extensional notions. This conjecture is formulated precisely in higher-order logic, and concrete cases in which it fails are examined. The paper ends with a discussion of the logic of broad necessity. It is shown that the logic of broad necessity is a normal modal logic between S4 and Triv, and that it is consistent with a natural axiomatic system of higher-order logic that it is exactly S4. Some philosophical reasons to think that the logic of broad necessity does not include the S5 principle are given. (shrink)

A number of authors have objected to the application of non-classical logic to problems in philosophy on the basis that these non-classical logics are usually characterised by a classical metatheory. In many cases the problem amounts to more than just a discrepancy; the very phenomena responsible for non-classicality occur in the field of semantics as much as they do elsewhere. The phenomena of higher order vagueness and the revenge liar are just two such examples. The aim of this paper is (...) to show that a large class of non-classical logics are strong enough to formulate their own model theory in a corresponding non-classical set theory. Specifically I show that adequate definitions of validity can be given for the propositional calculus in such a way that the metatheory proves, in the specified logic, that every theorem of the propositional fragment of that logic is validated. It is shown that in some cases it may fail to be a classical matter whether a given sentence is valid or not. One surprising conclusion for non-classical accounts of vagueness is drawn: there can be no axiomatic, and therefore precise, system which is determinately sound and complete. (shrink)

The form of nominalism known as 'mathematical fictionalism' is examined and found wanting, mainly on grounds that go back to an early antinominalist work of Rudolf Carnap that has unfortunately not been paid sufficient attention by more recent writers.

We analyse Kreisel’s notion of human-effective computability. Like Kreisel, we relate this notion to a concept of informal provability, but we disagree with Kreisel about the precise way in which this is best done. The resulting two different ways of analysing human-effective computability give rise to two different variants of Church’s thesis. These are both investigated by relating them to transfinite progressions of formal theories in the sense of Feferman.

Jean van Heijenoort was best known for his editorial work in the history of mathematical logic. I survey his contributions to model-theoretic proof theory, and in particular to the falsifiability tree method. This work of van Heijenoort’s is not widely known, and much of it remains unpublished. A complete list of van Heijenoort’s unpublished writings on tableaux methods and related work in proof theory is appended.

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)

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)

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)

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)