One of the main problems plaguing neo-logicism is the Bad Company challenge: the need for a well-motivated account of which abstraction principles provide legitimate definitions of mathematical concepts. In this article a solution to the Bad Company challenge is provided, based on the idea that definitions ought to be conservative. Although the standard formulation of conservativeness is not sufficient for acceptability, since there are conservative but pairwise incompatible abstraction principles, a stronger conservativeness condition is sufficient: that the class of acceptable (...) abstraction principles be strictly logically symmetrically class conservative . The article concludes with an examination of which classes of abstraction principles meet this criteria. (shrink)

The great logician Gottlob Frege attempted to provide a purely logical foundation for mathematics. His system collapsed when Bertrand Russell discovered a contradiction in it. Thereafter, mathematicians and logicians, beginning with Russell himself, turned in other directions to look for a framework for modern abstract mathematics. Over the past couple of decades, however, logicians and philosophers have discovered that much more is salvageable from the rubble of Frege's system than had previously been assumed. A variety of repaired systems have been (...) proposed, each a consistent theory permitting the development of a significant portion of mathematics. This book surveys the assortment of methods put forth for fixing Frege's system, in an attempt to determine just how much of mathematics can be reconstructed in each. John Burgess considers every proposed fix, each with its distinctive philosophical advantages and drawbacks. These systems range from those barely able to reconstruct the rudiments of arithmetic to those that go well beyond the generally accepted axioms of set theory into the speculative realm of large cardinals. For the most part, Burgess finds that attempts to fix Frege do less than advertised to revive his system. This book will be the benchmark against which future analyses of the revival of Frege will be measured. (shrink)

The logical status of abstraction principles, and especially Hume’s Principle, has been long debated, but the best currently availeble tool for explicating a notion’s logical character—permutation invariance—has not received a lot of attention in this debate. This paper aims to fill this gap. After characterizing abstraction principles as particular mappings from the subsets of a domain into that domain and exploring some of their properties, the paper introduces several distinct notions of permutation invariance for such principles, assessing the philosophical significance (...) of each. (shrink)

This paper presents a formalization of first-order arithmetic characterizing the natural numbers as abstracta of the equinumerosity relation. The formalization turns on the interaction of a nonstandard cardinality quantifier with an abstraction operator assigning objects to predicates. The project draws its philosophical motivation from a nonreductionist conception of logicism, a deflationary view of abstraction, and an approach to formal arithmetic that emphasizes the cardinal properties of the natural numbers over the structural ones.

Moving beyond both realist and anti-realist accounts of mathematics, Shapiro articulates a "structuralist" approach, arguing that the subject matter of a mathematical theory is not a fixed domain of numbers that exist independent of each other, but rather is the natural structure, the pattern common to any system of objects that has an initial object and successor relation satisfying the induction principle.

One recent `neologicist' claim is that what has come to be known as "Frege's Theorem"–the result that Hume's Principle, plus second-order logic, suffices for a proof of the Dedekind-Peano postulate–reinstates Frege's contention that arithmetic is analytic. This claim naturally depends upon the analyticity of Hume's Principle itself. The present paper reviews five misgivings that developed in various of George Boolos's writings. It observes that each of them really concerns not `analyticity' but either the truth of Hume's Principle or our entitlement (...) to accept it and reviews possible neologicist replies. A two-part Appendix explores recent developments of the fifth of Boolos's objections–the problem of Bad Company–and outlines a proof of the principle $N^q$, an important part of the defense of the claim that what follows from Hume's Principle is not merely a theory which allows of interpretation as arithmetic but arithmetic itself. (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)

Frege's Grundgesetze was one of the 19th century forerunners to contemporary set theory which was plagued by the Russell paradox. In recent years, it has been shown that subsystems of the Grundgesetze formed by restricting the comprehension schema are consistent. One aim of this paper is to ascertain how much set theory can be developed within these consistent fragments of the Grundgesetze, and our main theorem shows that there is a model of a fragment of the Grundgesetze which defines a (...) model of all the axioms of Zermelo-Fraenkel set theory with the exception of the power set axiom. The proof of this result appeals to G\"odel's constructible universe of sets, which G\"odel famously used to show the relative consistency of the continuum hypothesis. More specifically, our proofs appeal to Kripke and Platek's idea of the projectum within the constructible universe as well as to a weak version of uniformization (which does not involve knowledge of Jensen's fine structure theory). The axioms of the Grundgesetze are examples of abstraction principles, and the other primary aim of this paper is to articulate a sufficient condition for the consistency of abstraction principles with limited amounts of comprehension. As an application, we resolve an analogue of the joint consistency problem in the predicative setting. (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)

We show that the categoricity of second-order Peano axioms can be proved from the comprehension axioms. We also show that the categoricity of second-order Zermelo–Fraenkel axioms, given the order type of the ordinals, can be proved from the comprehension axioms. Thus these well-known categoricity results do not need the so-called “full” second-order logic, the Henkin second-order logic is enough. We also address the question of “consistency” of these axiom systems in the second-order sense, that is, the question of existence of (...) models for these systems. In both cases we give a consistency proof, but naturally we have to assume more than the mere comprehension axioms. (shrink)

In this manuscript, published here for the first time, Tarski explores the concept of logical notion. He draws on Klein's Erlanger Programm to locate the logical notions of ordinary geometry as those invariant under all transformations of space. Generalizing, he explicates the concept of logical notion of an arbitrary discipline.

The days when Frege was more footnoted than read are now long gone; still, until very recently he has been read rather selectively. No doubt many had an inkling that there’s more to Frege than the sense/reference distinction; but few, one suspects, thought that his philosophy of mathematics was as fertile and intriguing as the present collection demonstrates. Perhaps, as Paul Benacerraf’s essay in this collection suggests, logical positivism should be held partly responsible for the neglect of this aspect of (...) Frege’s thought, since it contributed to the following common impression of Frege’s philosophy of mathematics: Frege’s project was to reduce arithmetic to logic, in order to provide an empiricist account of mathematical knowledge; Russell’s paradox showed that this was not possible, and that the best that can be done is to reduce arithmetic to set theory; so, Frege’s logicism is demonstrably a philosophical dead end. (shrink)

One of the earliest discussions of the so-called 'bad company' objection to Neo-Fregeanism, I show that the consistency of an arbitrary second-order 'contextual definition' (nowadays known as an 'abstraction principle' is recursively undecidable. I go on to suggest that an acceptable such principle should satisfy a condition nowadays known as 'stablity'.

We examine George Boolos's proposed abstraction principle for extensions based on the limitation-of-size conception, New V, from several perspectives. Crispin Wright once suggested that New V could serve as part of a neo-logicist development of real analysis. We show that it fails both of the conservativeness criteria for abstraction principles that Wright proposes. Thus, we support Boolos against Wright. We also show that, when combined with the axioms for Boolos's iterative notion of set, New V yields a system equivalent to (...) full Zermelo-Fraenkel set theory with a principle of global choice. This advances Boolos's longstanding interest in the foundations of set theory. (shrink)

Mathematical realism is the doctrine that mathematical objects really exist, that mathematical statements are either determinately true or determinately false, and that the accepted mathematical axioms are predominantly true. A realist understanding of set theory has it that when the sentences of the language of set theory are understood in their standard meaning, each sentence has a determinate truth value, so that there is a fact of the matter whether the cardinality of the continuum is א2 or whether there are (...) measurable cardinals, whether or not those facts are knowable by us. (shrink)

Let me start with a well-known story. Kant held that logic and conceptual analysis alone cannot account for our knowledge of arithmetic: “however we might turn and twist our concepts, we could never, by the mere analysis of them, and without the aid of intuition, discover what is the sum [7+5]” (KrV, B16). Frege took himself to have shown that Kant was wrong about this. According to Frege’s logicist thesis, every arithmetical concept can be defined in purely logical terms, and (...) every theorem of arithmetic can be proved using only the basic laws of logic. Hence, Kant was wrong to think that our grasp of arithmetical concepts and our knowledge of arithmetical truth depend on an extralogical source—the pure intuition of time (Frege 1884, §89, §109). Arithmetic, properly understood, is just a part of logic. (shrink)

George Boolos has described an interpretation of a fragment of ZFC in a consistent second-order theory whose only axiom is a modification of Frege's inconsistent Axiom V. We build on Boolos's interpretation and study the models of a variety of such theories obtained by amending Axiom V in the spirit of a limitation of size principle. After providing a complete structural description of all well-founded models, we turn to the non-well-founded ones. We show how to build models in which foundation (...) fails in prescribed ways. In particular, we obtain models in which every relation is isomorphic to the membership relation on some set as well as models of Aczel's anti-foundation axiom (AFA). We suggest that Fregean extensions provide a natural way to envisage non-well-founded membership. (shrink)

A model-theoretic approach to the semantics of set-theoretic discourse.

This paper contains an outline of some of the main philosophical and technical claims of my book _The Limits ofion<D>.