This entry introduces the reader to the main ideas in Frege's philosophy of logic, mathematics, and language.

A central element in neo-Fregean philosophy of mathematics is the focus on abstraction principles, and the use of abstraction principles to ground various areas of mathematics. But as is well known, not all abstraction principles are in good standing. Various proposals for singling out the acceptable abstraction principles have been presented. Here I investigate what philosophical underpinnings can be provided for these proposals; specifically, underpinnings that fit the neo-Fregean's general outlook. Among the philosophical ideas I consider are: general views on (...) a priori justification; the idea of abstraction as reconceptualization, the idea that truth is prior to reference in the sense associated with Frege's context principle; and various broadly relativistic views. The conclusions are by and large negative. (shrink)

The rather unrestrained use of second-order logic in the neo-logicist program is critically examined. It is argued in some detail that it brings with it genuine set-theoretical existence assumptions and that the mathematical power that Hume’s Principle seems to provide, in the derivation of Frege’s Theorem, comes largely from the ‘logic’ assumed rather than from Hume’s Principle. It is shown that Hume’s Principle is in reality not stronger than the very weak Robinson Arithmetic Q. Consequently, only a few rudimentary facts (...) of arithmetic are logically derivable from Hume’s Principle. And that hardly counts as a vindication of logicism. (shrink)

We shall use Gödel’s Second Incompleteness Theorem to show that consistency is not possibility, and then argue that the argument does serious damage to some theories of modality where consistency plays a major but not exclusive role.

In this paper, we characterize the strength of the predicative Frege hierarchy, , introduced by John Burgess in his book [J. Burgess, Fixing frege, in: Princeton Monographs in Philosophy, Princeton University Press, Princeton, 2005]. We show that and are mutually interpretable. It follows that is mutually interpretable with Q. This fact was proved earlier by Mihai Ganea in [M. Ganea, Burgess’ PV is Robinson’s Q, The Journal of Symbolic Logic 72 619–624] using a different proof. Another consequence of the our (...) main result is that is mutually interpretable with Kalmar Arithmetic . The fact that interprets EA was proved earlier by Burgess. We provide a different proof. Each of the theories is finitely axiomatizable. Our main result implies that the whole hierarchy taken together, , is not finitely axiomatizable. What is more: no theory that is mutually locally interpretable with is finitely axiomatizable. (shrink)

A crucial part of the contemporary interest in logicism in the philosophy of mathematics resides in its idea that arithmetical knowledge may be based on logical knowledge. Here an implementation of this idea is considered that holds that knowledge of arithmetical principles may be based on two things: (i) knowledge of logical principles and (ii) knowledge that the arithmetical principles are representable in the logical principles. The notions of representation considered here are related to theory-based and structure-based notions of representation (...) from contemporary mathematical logic. It is argued that the theory-based versions of such logicism are either too liberal (the plethora problem) or are committed to intuitively incorrect closure conditions (the consistency problem). Structure-based versions must on the other hand respond to a charge of begging the question (the circularity problem) or explain how one may have a knowledge of structure in advance of a knowledge of axioms (the signature problem). This discussion is significant because it gives us a better idea of what a notion of representation must look like if it is to aid in realizing some of the traditional epistemic aims of logicism in the philosophy of mathematics. (shrink)

PG (Plural Grundgesetze) is a consistent second-order system which is aimed to derive second-order Peano arithmetic. It employs the notion of plural quantification and a few Fregean devices, among which the infamous Basic Law V. George Boolos’ plural semantics is replaced with Enrico Martino’s Acts of Choice Semantics (ACS), which is developed from the notion of arbitrary reference in mathematical reasoning. Also, substitutional quantification is exploited to interpret quantification into predicate position. ACS provides a form of logicism which is radically (...) alternative to Frege’s and which is grounded on the existence of individuals rather than on the existence of concepts. (shrink)

Fitch's basic logic is an untyped illative combinatory logic with unrestricted principles of abstraction effecting a type collapse between properties (or concepts) and individual elements of an abstract syntax. Fitch does not work axiomatically and the abstraction operation is not a primitive feature of the inductive clauses defining the logic. Fitch's proof that basic logic has unlimited abstraction is not clear and his proof contains a number of errors that have so far gone undetected. This paper corrects these errors and (...) presents a reasonably intuitive proof that Fitch's system K supports an implicit abstraction operation. Some general remarks on the philosophical significance of basic logic, especially with respect to neo-logicism, are offered, and the paper concludes that basic logic models a highly intensional form of logicism. (shrink)

Many philosophers have become worried about the use of standard real numbers for the probability function that represents an agent's credences. They point out that real numbers can't capture the distinction between certain extremely unlikely events and genuinely impossible ones—they are both represented by credence 0, which violates a principle known as “regularity.” Following Skyrms 1980 and Lewis 1980, they recommend that we should instead use a much richer set of numbers, called the “hyperreals.” This essay argues that this popular (...) view is the result of two mistakes. The first mistake, which this essay calls the “numerical fallacy,” is to assume that a distinction that isn't represented by different numbers isn't represented at all in a mathematical representation. In this case, the essay claims that although the real numbers do not make all relevant distinctions, the full mathematical structure of a probability function does. The second mistake is that the hyperreals make too many distinctions. They have a much more complex structure than credences in ordinary propositions can have, so they make distinctions that don't exist among credences. While they might be useful for generating certain mathematical models, they will not appear in a faithful mathematical representation of credences of ordinary propositions. (shrink)

This paper investigates, formulates and proves an indexical barrier theorem, according to which sets of non-indexical sentences do not entail (except under specified special circumstances) indexical sentences. It surveys the usual difficulties for this kind of project, as well some that are specific to the case of indexicals, and adapts the strategy of Restall and Russell's "Barriers to Implication" to overcome these. At the end of the paper a reverse barrier theorem is also proved, according to which an indexical sentence (...) will not, except under specified circumstances, entail a non-indexical one. (shrink)

Philosophers love a priori knowledge: we delight in truths that can be known from the comfort of our armchairs, without the need to venture out in the world for confirmation. This is due not to laziness, but to two different considerations. First, it seems that many philosophical issues aren’t settled by our experience of the world — the nature of morality; the way concepts pick out objects; the structure of our experience of the world in which we find ourselves — (...) these issues seem to be decided not on the basis of our experience, but in some manner by things prior to (or independently of) that experience. Second, even when we are deeply interested in how our experience lends credence to our claims about the world, the matter remains of the remainder: we learn more about how experience contributes to knowledge when we see what knowledge is available independent of that experience. (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)

Øystein Linnebo has recently shown that the existence of successors cannot be proven in predicative Frege arithmetic, using Frege’s definitions of arithmetical notions. By contrast, it is shown here that the existence of successor can be proven in ramified predicative Frege arithmetic.

Second-order Peano Arithmetic minus the Successor Axiom is developed from first principles through Quadratic Reciprocity and a proof of self-consistency. This paper combines 4 other papers of the author in a self-contained exposition.

In the language of second-order logic, first- and second-order variables are distinguished syntactically and cannot be grammatically substituted. According to a prominent argument for the deployment of these languages, these substitution failures are necessary to block the derivation of paradoxes that result from attempts to generalize over predicate interpretations. I first examine previous approaches which interpret second-order sentences using expressions of natural language and argue that these approaches undermine these syntactic restrictions. I then examine Williamson’s primitivist approach according to which (...) second-order sentences are not offered readings in a previously understood language. I argue that the syntactic restrictions alone do not block the derivation of the paradox, unless they are backed by a principled reason that the language cannot be expanded to allow the grammatical substitution of first- and second- order variables. I argue that there is neither a syntactic nor a semantic principle that prohibits such an expansion. (shrink)

In two recent papers, Bob Hale has attempted to free second-order logic of the 'staggering existential assumptions' with which Quine famously attempted to saddle it. I argue, first, that the ontological issue is at best secondary: the crucial issue about second-order logic, at least for a neo-logicist, is epistemological. I then argue that neither Crispin Wright's attempt to characterize a `neutralist' conception of quantification that is wholly independent of existential commitment, nor Hale's attempt to characterize the second-order domain in terms (...) of definability, can serve a neo-logicist's purposes. The problem, in both cases, is similar: neither Wright nor Hale is sufficiently sensitive to the demands that impredicativity imposes. Finally, I defend my own earlier attempt to finesse this issue, in "A Logic for Frege's Theorem", from Hale's criticisms. (shrink)

Within the context of the Quine–Putnam indispensability argument, one discussion about the status of mathematics is concerned with the ‘Enhanced Indispensability Argument’, which makes explicit in what way mathematics is supposed to be indispensable in science, namely explanatory. If there are genuine mathematical explanations of empirical phenomena, an argument for mathematical platonism could be extracted by using inference to the best explanation. The best explanation of the primeness of the life cycles of Periodical Cicadas is genuinely mathematical, according to Baker (...) :223–238, 2005; Br J Philos Sci 60:611–633, 2009). Furthermore, the result is then also used to strengthen the platonist position :779–793, 2017a). We pick up the circularity problem brought up by Leng Mathematical reasoning, heuristics and the development of mathematics, King’s College Publications, London, pp 167–189, 2005) and Bangu :13–20, 2008). We will argue that Baker’s attempt to solve this problem fails, if Hume’s Principle is analytic. We will also provide the opponent of the Enhanced Indispensability Argument with the so-called ‘interpretability strategy’, which can be used to come up with alternative explanations in case Hume’s Principle is non-analytic. (shrink)

The question of the analyticity of Hume’s Principle (HP) is central to the neo-logicist project. We take on this question with respect to Frege’s definition of analyticity, which entails that a sentence cannot be analytic if it can be consistently denied within the sphere of a special science. We show that HP can be denied within non-standard analysis and argue that if HP is taken to depend on Frege’s definition of number, it isn’t analytic, and if HP is taken to (...) be primitive there is only a very narrow range of circumstances where it might be taken to be analytic. The latter discussion also sheds some light on the connections between the Bad Company and Caesar objections. (shrink)

This paper investigates a set of issues connected with the so-called conservativeness argument against deflationism. Although I do not defend that argument, I think the discussion of it has raised some interesting questions about whether what I call “compositional principles,” such as “a conjunction is true iff its conjuncts are true,” have substantial content or are in some sense logically trivial. The paper presents a series of results that purport to show that the compositional principles for a first-order language, taken (...) together, have substantial logical strength, amounting to a kind of abstract consistency statement. (shrink)

In this note we derive Robinson???s Arithmetic from Hume???s Principle in the context of very weak theories of classes and relations.

Quine often argued for a simple, untyped system of logic rather than the typed systems that were championed by Russell and Carnap, among others. He claimed that nothing important would be lost by eliminating sorts, and the result would be additional simplicity and elegance. In support of this claim, Quine conjectured that every many-sorted theory is equivalent to a single-sorted theory. We make this conjecture precise, and prove that it is true, at least according to one reasonable notion of theoretical (...) equivalence. Our clarification of Quine’s conjecture, however, exposes the shortcomings of his argument against many-sorted logic. (shrink)

This paper attempts to address the question what logical strength theories of truth have by considering such questions as: If you take a theory T and add a theory of truth to it, how strong is the resulting theory, as compared to T? It turns out that, in a wide range of cases, we can get some nice answers to this question, but only if we work in a framework that is somewhat different from those usually employed in discussions of (...) axiomatic theories of truth. These results are then used to address a range of philosophical questions connected with truth, such as what Tarski meant by "essential richness" and the so-called conservativeness argument against deflationism. -/- This draft dates from about 2009, with some significant updates having been made around 2011. Around then, however, I decided that the paper was becoming unmanageable and that I was trying to do too many things in it. I have therefore exploded the paper into several pieces, which will be published separately. These include "Disquotationalism and the Compositional Principles", "The Logical Strength of Compositional Principles", "Consistency and the Theory of Truth", and "What Is Essential Richness?" You should probably read those instead, since this draft remains a bit of a mess. Terminology and notation are inconsistent, and some of the proofs aren't quite right. So, caveat lector. I make it public only because it has been cited in a few places now. (shrink)

The primary purpose of this note is to demonstrate that predicative Frege arithmetic naturally interprets certain weak but non-trivial arithmetical theories. It will take almost as long to explain what this means and why it matters as it will to prove the results.

It can be argued that only the equational theories of some sub-elementary function algebras are finitistic or intuitive according to a certain interpretation of Hilbert's conception of intuition. The purpose of this paper is to investigate the relation of those restricted forms of equational reasoning to classical quantifier logic in arithmetic. The conclusion reached is that Edward Nelson's ‘predicative arithmetic’ program, which makes essential use of classical quantifier logic, cannot be justified finitistically and thus requires a different philosophical foundation, possibly (...) as a restricted form of logicism. (shrink)

In this paper, I consider an argument for the claim that any satisfactory epistemology of mathematics will violate core tenets of naturalism, i.e. that mathematics cannot be naturalized. I find little reason for optimism that the argument can be effectively answered.

It has been known for a few years that no more than Pi-1-1 comprehension is needed for the proof of "Frege's Theorem". One can at least imagine a view that would regard Pi-1-1 comprehension axioms as logical truths but deny that status to any that are more complex—a view that would, in particular, deny that full second-order logic deserves the name. Such a view would serve the purposes of neo-logicists. It is, in fact, no part of my view that, say, (...) Delta-3-1 comprehension axioms are not logical truths. What I am going to suggest, however, is that there is a special case to be made on behalf of Pi-1-1 comprehension. Making the case involves investigating extensions of first-order logic that do not rely upon the presence of second-order quantifiers. A formal system for so-called "ancestral logic" is developed, and it is then extended to yield what I call "Arché logic". (shrink)

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

The neo-Fregean project of basing mathematics on abstraction principles faces “the bad company problem,” namely that a great variety of unacceptable abstraction principles are mixed in among the acceptable ones. In this paper I propose a new solution to the problem, based on the idea that individuation must take the form of a well-founded process. A surprising aspect of this solution is that every form of abstraction on concepts is permissible and that paradox is instead avoided by restricting what concepts (...) there are. (shrink)

Is a logicist bound to the claim that as a matter of analytic truth there is an actual infinity of objects? If Hume’s Principle is analytic then in the standard setting the answer appears to be yes. Hodes’s work pointed to a way out by offering a modal picture in which only a potential infinity was posited. However, this project was abandoned due to apparent failures of cross-world predication. We re-explore this idea and discover that in the setting of the (...) potential infinite one can interpret first-order Peano arithmetic, but not second-order Peano arithmetic. We conclude that in order for the logicist to weaken the metaphysically loaded claim of necessary actual infinities, they must also weaken the mathematics they recover. (shrink)

This paper presents a new approach to the class-theoretic paradoxes. In the first part of the paper, I will distinguish classes from sets, describe the function of class talk, and present several reasons for postulating type-free classes. This involves applications to the problem of unrestricted quantification, reduction of properties, natural language semantics, and the epistemology of mathematics. In the second part of the paper, I will present some axioms for type-free classes. My approach is loosely based on the Gödel–Russell idea (...) of limited ranges of significance. It is shown how to derive the second-order Dedekind–Peano axioms within that theory. I conclude by discussing whether the theory can be used as a solution to the problem of unrestricted quantification. In an appendix, I prove the consistency of the class theory relative to Zermelo–Fraenkel set theory. (shrink)

Neologicists have sought to ground mathematical knowledge in abstraction. One especially obstinate problem for this account is the bad company problem. The leading neologicist strategy for resolving this problem is to attempt to sift the good abstraction principles from the bad. This response faces a dilemma: the system of ‘good’ abstraction principles either falls foul of the Scylla of inconsistency or the Charybdis of being unable to recover a modest portion of Zermelo–Fraenkel set theory with its intended generality. This article (...) argues that the bad company problem is due to the ‘static’ character of abstraction on the neologicist's account and develops a ‘dynamic’ account of abstraction that avoids both horns of the dilemma. 1 Introduction2ion Reconstructed3 From Bad to Worse4 Abstraction Reconceived5 Bad Company Made GoodA AppendixA.1SemanticsA.2LogicA.3ConsistencyA.4Strength. (shrink)

This essay examines Frege's reaction to Russell's Paradox and his views about the grounding of existence claims in mathematics. It is argued that Frege's strict requirements on existential proofs would rule out the attempt to ground arithmetic in. It is hoped that this discussion will help to clarify the ways in which Frege's position is both coherent and significantly different from the neo-logicist position on the issues of: what's required for proofs of existence; the connection between models, consistency, and existence; (...) and the prospects for a logical grounding of arithmetic in the wake of the paradox. (shrink)

Neo-Fregean logicism seeks to base mathematics on abstraction principles. But the acceptable abstraction principles are surrounded by unacceptable ones. This is the "bad company problem." In this introduction I first provide a brief historical overview of the problem. Then I outline the main responses that are currently being debated. In the course of doing so I provide summaries of the contributions to this special issue.

ABSTRACT Four philosophical concerns about higher-order logic in general and the specific demands placed on it by the neo-logicist project are distinguished. The paper critically reviews recent responses to these concerns by, respectively, the late Bob Hale, Richard Kimberly Heck, and myself. It is argued that these score some successes. The main aim of the paper, however, is to argue that the most serious objection to the applications of higher-order logic required by the neo-logicist project has not been properly understood. (...) The paper concludes by outlining a strategy, prefigured in recent work of Øystein Linnebo, for meeting this objection. (shrink)

1. Philosophical background: iteration, ineffability, reflection. There are at least two heuristic motivations for the axioms of standard set theory, by which we mean, as usual, first-order Zermelo–Fraenkel set theory with the axiom of choice (ZFC): the iterative conception and limitation of size (see Boolos, 1989). Each strand provides a rather hospitable environment for the hypothesis that the set-theoretic universe is ineffable, which is our target in this paper, although the motivation is different in each case.

Reply to Beaney: the closing of the historical mindIn his comments, Michael Beaney sets himself up as the arbiter of what is genuine history and what isn’t. While celebrating the outpouring of specialized scholarship on Frege, he has no patience with the enterprise outlined in the Précis, which attempts to construct a large-scale picture of the richness of the analytic tradition. That enterprise is one in which great figures of our recent past are challenged by aspects of contemporary thought, and (...) our current struggles are enriched by insights of theirs that haven’t been fully absorbed. Although some work of this sort can be done piecemeal, one historical figure at a time, there is much to be learned from a more encompassing perspective. While no picture constructed by a single author can be authoritative about everything, the attempt to give informative, connected assessments of major milestones in the tradition is our best hope of understanding who we are and where we have come from. (shrink)

In this symposium contribution I critically review the first two chapters, on Frege, in Volume 1 of The Analytic Tradition in Philosophy by Scott Soames.

Kripke’s notion of groundedness plays a central role in many responses to the semantic paradoxes. Can the notion of groundedness be brought to bear on the paradoxes that arise in connection with abstraction principles? We explore a version of grounded abstraction whereby term models are built up in a ‘grounded’ manner. The results are mixed. Our method solves a problem concerning circularity and yields a ‘grounded’ model for the predicative theory based on Frege’s Basic Law V. However, the method is (...) poorly behaved unless the background second-order logic is predicative. (shrink)

In this paper, we investigate the phenomenon ofspeed-upin the context of theories of truth. We focus on axiomatic theories of truth extending Peano arithmetic. We are particularly interested on whether conservative extensions of PA have speed-up and on how this relates to a deflationist account. We show that disquotational theories have no significant speed-up, in contrast to some compositional theories, and we briefly assess the philosophical implications of these results.

We present a logically detailed case-study of Darwinian evolutionary explanation. Special features of Darwin’s explanatory schema made it an unusual theoretical breakthrough, from the point of view of the philosophy of science. The schema employs no theoretical terms, and puts forward no theoretical hypotheses. Instead, it uses three observational generalizations—Variability, Heritability and Differential Reproduction—along with an innocuous assumption of Causal Efficacy, to derive Adaptive Evolution as a necessary consequence. Adaptive Evolution in turn, with one assumption of scale (‘Deep Time’), implies (...) the observational generalization of Adaptation. It is a fascinating methodological task to regiment the premises and make the reasoning both rigorous and clear. Doing so reveals how surprisingly small an amount of mathematics is needed in order to carry out the argument. The investigation also reveals the crucial role played by heritability, and how heritability itself admits of Darwinian explanation. (shrink)

In this paper we show how to interpret Robinson’s arithmetic Q and the theory R of Tarski, Mostowski, and Robinson as theories of cardinals in very weak theories of relations over a domain.

This article treats three aspects of Frege's discussions of definitions. First, I survey Frege's main criticisms of definitions in mathematics. Second, I consider Frege's apparent change of mind on the legitimacy of contextual definitions and its significance for recent neo-Fregean logicism. In the remainder of the article I discuss a critical question about the definitions on which Frege's proofs of the laws of arithmetic depend: do the logical structures of the definientia reflect the understanding of arithmetical terms prevailing prior to (...) Frege's analyses? Unless they do, it is unclear how Frege's proofs demonstrate the analyticity of the arithmetic in use before logicism. Yet, especially in late writings, Frege characterizes definitions as arbitrary stipulations of the senses or references of expressions unrelated to pre-definitional understanding. I conclude by examining some options for conceiving of the status of Frege's logicism in light of this apparent tension, and outline a suggestion for a philosophically fruitful way of resolving this tension. (shrink)

The topic of this paper is our knowledge of the natural numbers, and in particular, our knowledge of the basic axioms for the natural numbers, namely the Peano axioms. The thesis defended in this paper is that knowledge of these axioms may be gained by recourse to judgements of probability. While considerations of probability have come to the forefront in recent epistemology, it seems safe to say that the thesis defended here is heterodox from the vantage point of traditional philosophy (...) of mathematics. So this paper focuses on providing a preliminary defense of this thesis, in that it focuses on responding to several objections. Some of these objections are from the classical literature, such as Frege's concern about indiscernibility and circularity, while other are more recent, such as Baker's concern about the unreliability of small samplings in the setting of arithmetic. Another family of objections suggests that we simply do not have access to probability assignments in the setting of arithmetic, either due to issues related to the~$\omega$-rule or to the non-computability and non-continuity of probability assignments. Articulating these objections and the responses to them involves developing some non-trivial results on probability assignments, such as a forcing argument to establish the existence of continuous probability assignments that may be computably approximated. In the concluding section, two problems for future work are discussed: developing the source of arithmetical confirmation and responding to the probabilistic liar. (shrink)

This paper presents new constructions of models of Hume's Principle and Basic Law V with restricted amounts of comprehension. The techniques used in these constructions are drawn from hyperarithmetic theory and the model theory of fields, and formalizing these techniques within various subsystems of second-order Peano arithmetic allows one to put upper and lower bounds on the interpretability strength of these theories and hence to compare these theories to the canonical subsystems of second-order arithmetic. The main results of this paper (...) are: (i) there is a consistent extension of the hyperarithmetic fragment of Basic Law V which interprets the hyperarithmetic fragment of second-order Peano arithmetic, and (ii) the hyperarithmetic fragment of Hume's Principle does not interpret the hyperarithmetic fragment of second-order Peano arithmetic, so that in this specific sense there is no predicative version of Frege's Theorem. (shrink)