Two thoughts about the concept of number are incompatible: that any zero or more things have a number, and that any zero or more things have a number only if they are the members of some one set. It is Russell's paradox that shows the thoughts incompatible: the sets that are not members of themselves cannot be the members of any one set. The thought that any things have a number is Frege's; the thought that things have a number only (...) if they are the members of a set may be Cantor's and is in any case a commonplace of the usual contemporary presentations of the set theory that originated with Cantor and has become ZFC.In recent years a number of authors have examined Frege's accounts of arithmetic with a view to extracting an interesting subtheory from Frege's formal system, whose inconsistency, as is well known, was demonstrated by Russell. These accounts are contained in Frege's formal treatise Grundgesetze der Arithmetik and his earlier exoteric book Die Grundlagen der Arithmetik. We may describe the two central results of the recent re-evaluation of his work in the following way: Let Frege arithmetic be the result of adjoining to full axiomatic second-order logic a suitable formalization of the statement that the Fs and the Gs have the same number if and only if the F sand the Gs are equinumerous. (shrink)

A brief, non-technical introduction to technical and philosophical aspects of Frege's philosophy of arithmetic. The exposition focuses on Frege's Theorem, which states that the axioms of arithmetic are provable, in second-order logic, from a single non-logical axiom, "Hume's Principle", which itself is: The number of Fs is the same as the number of Gs if, and only if, the Fs and Gs are in one-one correspondence.

One of the remarkable results of Frege’s Logicism is Frege’s Theorem, which holds that one can derive the main truths of Peano arithmetic from Hume’s Principle (HP) without using Frege’s Basic Law V. This result was rediscovered by the Neo-Fregeans and their allies. However, when applied in developing a more advanced theory of mathematics, their fundamental principles—the abstraction principles—incur some problems, e.g., that of inflation. This paper finds alternative paths for such inquiry in extensionalism and object (...) theory. (shrink)

As is well known, Frege gave an explicit definition of number (belonging to some concept) in ?68 of his Die Grundlagen der Arithmetik.

We note that a plural version of logicism about arithmetic is suggested by the standard reading of Hume's Principle in terms of `the number of Fs/Gs'. We lay out the resources needed to prove a version of Frege's principle in plural, rather than second-order, logic. We sketch a proof of the theorem and comment philosophically on the result, which sits well with a metaphysics of natural numbers as plural properties.

then E has a subset which is the domain of a model of Peano's axioms for the natural numbers. (This result is proved explicitly, using classical reasoning, in section 3 of [1].) My purpose in this note is to strengthen this result in two directions: first, the premise will be weakened so as to require only that the map ν be defined on the family of (Kuratowski) finite subsets of the set E, and secondly, the argument will be constructive, i.e., (...) will involve no use of the law of excluded middle. To be precise, we will prove, in constructive (or intuitionistic) set theory3, the following.. (shrink)

The book begins with an overview that introduces the Theorem and the issues surrounding it, and explores how the essays that follow contribute to our understanding of those issues.

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)

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)

In this entry, Frege's logic is introduced and described in some detail. It is shown how the Dedekind-Peano axioms for number theory can be derived from a consistent fragment of Frege's logic, with Hume's Principle replacing Basic Law V.

The following essay reconsiders the ontological and logical issues around Frege’s Basic Law (V). If focuses less on Russell’s Paradox, as most treatments of Frege’s Grundgesetze der Arithmetik (GGA)1 do, but rather on the relation between Frege’s Basic Law (V) and Cantor’s Theorem (CT). So for the most part the inconsistency of Naïve Comprehension (in the context of standard Second Order Logic) will not concern us, but rather the ontological issues central to the conflict between (BLV) (...) and (CT). These ontological issues are interesting in their own right. And if and only if in case ontological considerations make a strong case for something like (BLV) we have to trouble us with inconsistency and paraconsistency. These ontological issues also lead to a renewed methodological reflection what to assume or recognize as an axiom. (shrink)

We extend results of Bonet, Buss and Pitassi on Bondy’s Theorem and of Nozaki, Arai and Arai on Bollobás’ Theorem by proving that Frankl’s Theorem on the trace of sets has quasipolynomial size Frege proofs. For constant values of the parametert, we prove that Frankl’s Theorem has polynomial size AC0-Frege proofs from instances of the pigeonhole principle.

Concerns a problem posed, but not solved, by Frege in part III of his Grundgesetze. As a preliminary to defining ‘real number’, Frege attempts to analyse the notion of a quantitative domain. He was unaware of the previous attempt of Otto Holder to do this; it is remarked how much weaker Frege's assumptions were in deriving theorems than Holder's. Frege deals with groups on which there is a right‐invariant semilinear ordering, although he does not use this terminology. He is uncertain (...) whether it can be deduced that the ordering is also left‐invariant, and proves as much as possible without invoking the assumption that it is. The independence proof, due to Dr Peter Neumann, establishes that it could not be deduced. (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)

Frege's Grundgesetze der Arithmetik offers a conception of cpLogic as the study of functions. Among functions are included those that are concepts, i.e. characteristic functions whose values are the logical objects that are the True/the False. What, in Frege's view, are the objects the True/the False? Frege's stroke functions are themselves concepts. His stipulation introducing his negation stroke mentions that it yields [...]. But curiously no accommodating axiom is given, and there is no such theorem. Why is it that (...) some of Frege's informal stipulations never made appearances as axioms? I offer an explanation that sheds new light on the Grundgesetze. No axioms should over-determination the True as a logical object. Perhaps the True = 0, as would be common in the mathematics of characteristic functions. But the logical objects that are cardinal numbers are value ranges correlated with second-level numerical concepts by a non-homogeneous second-level value-range function [...]. The existence of concepts would be ontologically circular if the True is itself a number. We find this circularity perfectly agreeable to Frege, and suggest that he had accepted that the existence of functions that are concepts in his cpLogic may well be ontologically inseparable from the existence of his value-range function. His cpLogic itself stands or falls with the viability of some value-range function. (shrink)

Widespread interest in Frege's general philosophical writings is, relatively speaking, a fairly recent phenomenon. But it is only very recently that his philosophy of mathematics has begun to attract the attention it now enjoys. This interest has been elicited by the discovery of the remarkable mathematical properties of Frege's contextual definition of number and of the unique character of his proposals for a theory of the real numbers. This collection of essays addresses three main developments in recent work on Frege's (...) philosophy of mathematics: the emerging interest in the intellectual background to his logicism; the rediscovery of Frege's theorem; and the reevaluation of the mathematical content of The Basic Laws of Arithmetic. Each essay attempts a sympathetic, if not uncritical, reconstruction, evaluation, or extension of a facet of Frege's theory of arithmetic. Together they form an accessible and authoritative introduction to aspects of Frege's thought that have, until now, been largely missed by the philosophical community. (shrink)

A running commentary is offered on the first half of Frege’s Grundlagen der Arithmetik, §17, and suggests that Frege anticipated the method of demonstration used by Paul Bernays for the Deduction Theorem.

Hume's Principle, dear to neo-Logicists, maintains that equinumerosity is both necessary and sufficient for sameness of cardinal number. All the same, Whitehead demonstrated in Principia Mathematica's logic of relations that Cantor's power-class theorem entails that Hume's Principle admits of exceptions. Of course, Hume's Principle concerns cardinals and in Principia's ‘no-classes’ theory cardinals are not objects in Frege's sense. But this paper shows that the result applies as well to the theory of cardinal numbers as objects set out in Frege's (...) Grundgesetze. Though Frege did not realize it, Cantor's power-theorem entails that Frege's cardinals as objects do not always obey Hume's Principle. (shrink)

In this article, I compare Gottlob Frege's and Bernard Bolzano's rationalist conceptions of arithmetic. Each philosopher worked out a complicated system of propositions, all of which were set forth as true. The axioms, or basic truths, make up the foundations of the subject of arithmetic. Each member of the system which is not an axiom is related (objectively) to the axioms at the base. Even though this relation to the base may not yet be scientifically proven, the propositions of the (...) system include all of the truths of the science of arithmetic. I conclude the article by analyzing the respective views of Frege and Bolzano in the light of Gödel's first incompleteness theorem. (shrink)

I show that any sentence of nth-order (pure or applied) arithmetic can be expressed with no loss of compositionality as a second-order sentence containing no arithmetical vocabulary, and use this result to prove a completeness theorem for applied arithmetic. More specifically, I set forth an enriched second-order language L, a sentence A of L (which is true on the intended interpretation of L), and a compositionally recursive transformation Tr defined on formulas of L, and show that they have the (...) following two properties: (a) in a universe with at least [HEBREW LETTER BET] $_{n-2}$ objects, any formula of nth-order (pure or applied) arithmetic can be expressed as a formula of L, and (b) for any sentence $\ulcorner \phi \urcorner$ of L, $\ulcorner \phi^{Tr} \urcorner$ is a second-order sentence containing no arithmetical vocabulary, and nth $\mathcal{A} \vdash \ulcorner \phi \longleftrightarrow \phi^{Tr} \urcorner$. (shrink)

In Part III of his 1879 logic Frege proves a theorem in the theory of sequences on the basis of four definitions. He claims in Grundlagen that this proof, despite being strictly deductive, constitutes a real extension of our knowledge, that it is ampliative rather than merely explicative. Frege furthermore connects this idea of ampliative deductive proof to what he thinks of as a fruitful definition, one that draws new lines. My aim is to show that we can make (...) good sense of these claims if we read Frege’s notation diagrammatically, in particular, if we take that notation to have been designed to enable one to exhibit the (inferentially articulated) contents of concepts in a way that allows one to reason deductively on the basis of those contents. (shrink)

We show that, by choosing definitions carefully, a version of Frege's theorem can be proved in intuitionistic logic.

This paper discusses Frege's account of definition by induction in Grundgesetze and the two key theorems Frege proves using it.

What Frege’s paradox on concept and object (FP) consists in and the manner in which Frege coped with it (the ladder strategy) are briefly reviewed (§ 1). An idea for solving FP inspired by Husserl’s semantics is presented; it results in failure, for it leads to a version of Russell’s paradox, the usual solution of which implies something like a resurgence of FP (§ 2). A generalized version of Frege’s paradox (GFP) and an idea for solving it inspired (...) by Davidson’s semantics are presented; three theorems about recursive definability of truth are put forward and used to determine whether this idea can be successfully applied to certain putative forms of the Language of Science (§ 3). Proofs of these three theorems, in particular of the third, which answers a question that does not seem to have drawn logicians’ attention, are then given (§ 4). Finally, it turns out that there is a tension between the proposed solution of GFP and the idea of Language of Science assumed so far in this paper, and a way of solving it is proposed (§ 5). (shrink)

Confronted with Russell's Paradox, Frege wrote an appendix to volume II of his _Grundgesetze der Arithmetik_. In it he offered a revision to Basic Law V, and proclaimed with confidence that the major theorems for arithmetic are recoverable. This paper shows that Frege's revised system has been seriously undermined by interpretations that transcribe his system into a predicate logic that is inattentive to important details of his concept-script. By examining the revised system as a concept-script, we see how Frege imagined (...) that minor modifications of his former proofs would recover arithmetic. (shrink)

In this essay, I discuss some observations by Peirce which suggest he had some idea of the substantive metalogical differences between logics which permit both quantifiers and relations, and those which do not. Peirce thus seems to have had arguments?which even De Morgan and Frege lacked?that show the superior expressiveness of relational logics.

In this paper I suggest an answer to the question of what Frege means when he says that his logical system, the Begriffsschrift, is like the language Leibniz sketched, a lingua characteristica, and not merely a logical calculus. According to the nineteenth century studies, Leibniz’s lingua characteristica was supposed to be a language with which the truths of science and the constitution of its concepts could be accurately expressed. I argue that this is exactly what the Begriffsschrift is: it is (...) a language, since, unlike calculi, its sentential expressions express truths, and it is a characteristic language, since the meaning of its complex expressions depend only on the meanings of their constituents and on the way they are put together. In fact it is in itself already a science composed in accordance with the Classical Model of Science. What makes the Begriffsschrift so special is that Frege is able to accomplish these goals with using only grammatical or syncategorematic terms and so has a medium with which he can try to show analyticity of the theorems of arithmetic. (shrink)

In this paper, the author derives the Dedekind-Peano axioms for number theory from a consistent and general metaphysical theory of abstract objects. The derivation makes no appeal to primitive mathematical notions, implicit definitions, or a principle of infinity. The theorems proved constitute an important subset of the numbered propositions found in Frege's *Grundgesetze*. The proofs of the theorems reconstruct Frege's derivations, with the exception of the claim that every number has a successor, which is derived from a modal axiom that (...) (philosophical) logicians implicitly accept. In the final section of the paper, there is a brief philosophical discussion of how the present theory relates to the work of other philosophers attempting to reconstruct Frege's conception of numbers and logical objects. (shrink)

A key idea in both Frege's development of arithmetic in theGrundlagen[7] and Zermelo's 1904 proof [10] of the well-ordering theorem is that of a “type reducing” correspondence between second-level and first-level entities. In Frege's construction, the correspondence obtains betweenconceptandnumber, in Zermelo's (through the axiom of choice), betweensetandmember. In this paper, a formulation is given and a detailed investigation undertaken of a system ℱ of many-sorted first-order logic (first outlined in the Appendix to [6]) in which this notion of type (...) reducing correspondence is accorded a central role and which enables Frege's and Zermelo's constructions to be presented in such a way as to reveal their essential similarity. By adapting Bourbaki's version of Zermelo's proof of the well-ordering theorem, we show that, within ℱ, any correspondencecbetween second-level entities (here calledconcepts) and first-level ones (here calledobjects) induces a well-ordering relationW(c) in a canonical manner. We shall see that, whencis the “Fregean” correspondence between concepts and cardinal numbers,W(c) is (the well-ordering of) the ordinalω+ 1, and whencis a “Zermelian” choice function on concepts,W(c) is a well-ordering of the universal concept embracing all objects.In ℱ an important role is played by the notion ofextensionof a concept. To each conceptXwe assume there is assigned an objecte(X) in such a way that, for any conceptsX, Ysatisfying a certain predicateE, we havee(X) =e(Y) iff the same objects fall underXandY. (shrink)

In these articles, I describe Cantor’s power-class theorem, as well as a number of logical and philosophical paradoxes that stem from it, many of which were discovered or considered (implicitly or explicitly) in Bertrand Russell’s work. These include Russell’s paradox of the class of all classes not members of themselves, as well as others involving properties, propositions, descriptive senses, class-intensions, and equivalence classes of coextensional properties. Part I focuses on Cantor’s theorem, its proof, how it can be used (...) to manufacture paradoxes, Frege’s diagnosis of the core difficulty, and several broad categories of strategies for offering solutions to these paradoxes. (shrink)

First-order logic. The origin of modern foundational studies. Frege's system and the paradoxes. The teory of types. Zermelo-Fraenkel set theory. Hilbert's program and Godel's incompleteness theorems. The foundational systems of W.V. Quine. Categorical algebra.

The paper scrutinizes Frege's Euclideanism - his view of arithmetic and geometry as resting on a small number of self-evident axioms from which non-self-evident theorems can be proved. Frege's notions of self-evidence and axiom are discussed in some detail. Elements in Frege's position that are in apparent tension with his Euclideanism are considered - his introduction of axioms in The Basic Laws of Arithmetic through argument, his fallibilism about mathematical understanding, and his view that understanding is closely associated with inferential (...) abilities. The resolution of the tensions indicates that Frege maintained a sophisticated and challenging form of rationalism, one relevant to current epistemology and parts of the philosophy of mathematics. (shrink)

Frege Arithmetic (FA) is the second-order theory whose sole non-logical axiom is Hume’s Principle, which says that the number of F s is identical to the number of Gs if and only if the F s and the Gs can be one-to-one correlated. According to Frege’s Theorem, FA and some natural definitions imply all of second-order Peano Arithmetic. This paper distinguishes two dimensions of impredicativity involved in FA—one having to do with Hume’s Principle, the other, with the underlying (...) second-order logic—and investigates how much of Frege’s Theorem goes through in various partially predicative fragments of FA. Theorem 1 shows that almost everything goes through, the most important exception being the axiom that every natural number has a successor. Theorem 2 shows that the Successor Axiom cannot be proved in the theories that are predicative in either dimension. (shrink)

This chapter explores Gottlob Frege's contribution to logic. Frege has been called the greatest logician since Aristotle, but he failed to gain influence on the mathematical community of his time and the depth and pioneering character of his work was acknowledged only after the collapse of his logicist program due to the Zermelo–Russell antinomy in 1902. Frege, by proving his theorem χ without recourse to Wertverläufe, exhibited an inconsistency in the traditional notion of the extension of a concept. He (...) prompted our awareness of a situation the future analyses of which will hopefully not only deepen our systematic control of the interplay of concepts and their extensions but also improve our understanding of the historical development of the notion of “extension of a concept” and its historiographical assessment. (shrink)

Frege’s project has been characterized as an attempt to formulate a complete system of logic adequate to characterize mathematical theories such as arithmetic and set theory. As such, it was seen to fail by Gödel’s incompleteness theorem of 1931. It is argued, however, that this is to impose a later interpretation on the word ‘complete’ it is clear from Dedekind’s writings that at least as good as interpretation of completeness is categoricity. Whereas few interesting first-order mathematical theories are (...) categorical or complete, there are logical extensions of these theories into second-order and by the addition of generalized quantifiers which are categorical. Frege’s project really found success through Gödel’s completeness theorem of 1930 and the subsequent development of first- and higher-order model theory. (shrink)