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)

Frege's development of the theory of arithmetic in his Grundgesetze der Arithmetik has long been ignored, since the formal theory of the Grundgesetze is inconsistent. His derivations of the axioms of arithmetic from what is known as Hume's Principle do not, however, depend upon that axiom of the system--Axiom V--which is responsible for the inconsistency. On the contrary, Frege's proofs constitute a derivation of axioms for arithmetic from Hume's Principle, in (axiomatic) second-order logic. Moreover, though Frege does prove each of (...) the now standard Dedekind-Peano axioms, his proofs are devoted primarily to the derivation of his own axioms for arithmetic, which are somewhat different (though of course equivalent). These axioms, which may be yet more intuitive than the Dedekind-Peano axioms, may be taken to be "The Basic Laws of Cardinal Number", as Frege understood them. Though the axioms of arithmetic have been known to be derivable from Hume's Principle for about ten years now, it has not been widely recognized that Frege himself showed them so to be; nor has it been known that Frege made use of any axiomatization for arithmetic whatsoever. Grundgesetze is thus a work of much greater significance than has often been thought. First, Frege's use of the inconsistent Axiom V may invalidate certain of his claims regarding the philosophical significance of his work (viz., the establishment of Logicism), but it should not be allowed to obscure his mathematical accomplishments and his contribution to our understanding of arithmetic. Second, Frege's knowledge that arithmetic is derivable from Hume's Principle raises important sorts of questions about his philosophy of arithmetic. For example, "Why did Frege not simply abandon Axiom V and take Hume's Principle as an axiom?". (shrink)

In this paper, we investigate (1) what can be salvaged from the original project of "logicism" and (2) what is the best that can be done if we lower our sights a bit. Logicism is the view that "mathematics is reducible to logic alone", and there are a variety of reasons why it was a non-starter. We consider the various ways of weakening this claim so as to produce a "neologicism". Three ways are discussed: (1) expand the conception of logic (...) used in the reduction, (2) allow the addition of analytic-sounding principles to logic so that the reduction is not to "logic alone" but to logic and truths knowable a priori, and (3) revise the conception of "reducible". We show how the current versions of neologicism fit into this classification scheme, and then focus on a kind of neologicism which we take to have the most potential for achieving the epistemological goals of the original logicist project. We argue that that the "weaker" the form of neologicism, the more likely it is to be a new form of logicism, and show how our preferred system, though mathematically weak, is metaphysically and epistemogically strong, and can "reduce" arbitrary mathematical theories to logic and analytic truths, if given a legitimate new sense of "reduction". (shrink)

It is well known that Frege's system in the Grundgesetze der Arithmetik is formally inconsistent. Frege's instantiation rule for the second-order universal quantifier makes his system, except for minor differences, full (i.e., with unrestricted comprehension) second-order logic, augmented by an abstraction operator that abides to Frege's basic law V. A few years ago, Richard Heck proved the consistency of the fragment of Frege's theory obtained by restricting the comprehension schema to predicative formulae. He further conjectured that the more encompassing Δ₁¹-comprehension (...) schema would already be inconsistent. In the present paper, we show that this is not the case. (shrink)

Frege’s system of first-order logic is presented in a contemporary framework. The system described is distinguished by economy of expression and an unusual syntax.

Thought: A Journal of Philosophy, EarlyView.

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)

Abstractionist programs in the philosophy of mathematics have focused on abstraction principles, taken as implicit definitions of the objects in the range of their operators. In second-order logic (SOL) with predicative comprehension, such principles are consistent but also (individually) mathematically weak. This paper, inspired by the work of Boolos (Proceedings of the Aristotelian Society 87, 137–151, 1986) and Zalta (Abstract Objects, vol. 160 of Synthese Library, 1983), examines explicit definitions of abstract objects. These axioms state that there is a unique (...) abstract encoding all concepts satisfying a given formula $$\phi (F)$$, with F a concept variable. Such a system is inconsistent in full SOL. It can be made consistent with several intricate tweaks, as Zalta has shown. Our approach in this article is simpler: we use a novel method to establish consistency in a restrictive version of predicative SOL. The resulting system, RPEAO, interprets first-order PA in extensional contexts, and has a natural extension delivering a peculiar interpretation of PA $$^2$$. (shrink)

This paper sets out a predicative response to the Russell-Myhill paradox of propositions within the framework of Church’s intensional logic. A predicative response places restrictions on the full comprehension schema, which asserts that every formula determines a higher-order entity. In addition to motivating the restriction on the comprehension schema from intuitions about the stability of reference, this paper contains a consistency proof for the predicative response to the Russell-Myhill paradox. The models used to establish this consistency also model other axioms (...) of Church’s intensional logic that have been criticized by Parsons and Klement: this, it turns out, is due to resources which also permit an interpretation of a fragment of Gallin’s intensional logic. Finally, the relation between the predicative response to the Russell-Myhill paradox of propositions and the Russell paradox of sets is discussed, and it is shown that the predicative conception of set induced by this predicative intensional logic allows one to respond to the Wehmeier problem of many non-extensions. (shrink)

After a summary of earlier work it is shown that elementary or Kalmar arithmetic can be interpreted within the system of Russell's Principia Mathematica with the axiom of infinity but without the axiom of reducibility.

In Section 10 of Grundgesetze, Volume I, Frege advances a mathematical argument (known as the permutation argument), by means of which he intends to show that an arbitrary value-range may be identified with the True, and any other one with the False, without contradicting any stipulations previously introduced (we shall call this claim the identifiability thesis, following Schroeder-Heister (1987)). As far as we are aware, there is no consensus in the literature as to (i) the proper interpretation of the permutation (...) argument and the identifiability thesis, (ii) the validity of the permutation argument, and (iii) the truth of the identifiability thesis. In this paper, we undertake a detailed technical study of the two main lines of interpretation, and gather some evidence for favoring one interpretation over the other. (shrink)

Frege's theorem says that second-order Peano arithmetic is interpretable in Hume's Principle and full impredicative comprehension. Hume's Principle is one example of an abstraction principle, while another paradigmatic example is Basic Law V from Frege's Grundgesetze. In this paper we study the strength of abstraction principles in the presence of predicative restrictions on the comprehension schema, and in particular we study a predicative Fregean theory which contains all the abstraction principles whose underlying equivalence relations can be proven to be equivalence (...) relations in a weak background second-order logic. We show that this predicative Fregean theory interprets second-order Peano arithmetic. (shrink)

In Die Grundlagen der Arithmetik, Frege attempted to introduce cardinalnumbers as logical objects by means of a second-order abstraction principlewhich is now widely known as ``Hume's Principle'' (HP): The number of Fsis identical with the number of Gs if and only if F and G are equinumerous.The attempt miscarried, because in its role as a contextual definition HP fails tofix uniquely the reference of the cardinality operator ``the number of Fs''. Thisproblem of referential indeterminacy is usually called ``the Julius Caesar (...) problem''.In this paper, Frege's treatment of the problem in Grundlagen is critically assessed. In particular, I try to shed new light on it by paying special attention to the framework of his logicism in which it appears embedded. I argue, among other things, that the Caesar problem, which is supposed to stem from Frege's tentative inductive definition of the natural numbers, is only spurious, not genuine; that the genuine Caesar problem deriving from HP is a purely semantic one and that the prospects of removing it by explicitly defining cardinal numbers as objects which are not classes are presumably poor for Frege. I conclude by rejecting two closely connected theses concerning Caesar put forward by Richard Heck: (i) that Frege could not abandon Axiom V because he could not solve the Julius Caesar problem without it; (ii) that (by his own lights) his logicist programme in Grundgesetze der Arithmetik failed because he could not overcome that problem. (shrink)

In section 10 of Grundgesetze, Frege confronts an indeterm inacy left by his stipulations regarding his ‘smooth breathing’, from which names of valueranges are formed. Though there has been much discussion of his arguments, it remains unclear what this indeterminacy is; why it bothers Frege; and how he proposes to respond to it. The present paper attempts to answer these questions by reading section 10 as preparatory for the (fallacious) proof, given in section 31, that every expression of Frege's formal (...) language denotes. (shrink)

The system whose only predicate is identity, whose only nonlogical vocabulary is the abstraction operator, and whose axioms are all first-order instances of Frege's Axiom V is shown to be undecidable.

Frege's intention in section 31 of Grundgesetze is to show that every well-formed expression in his formal system denotes. But it has been obscure why he wants to do this and how he intends to do it. It is argued here that, in large part, Frege's purpose is to show that the smooth breathing, from which names of value-ranges are formed, denotes; that his proof that his other primitive expressions denote is sound and anticipates Tarski's theory of truth; and that (...) the proof that the smooth breathing denotes, while flawed, rests upon an idea now familiar from the completeness proof for first-order logic. The main work of the paper consists in defending a new understanding of the semantics Frege offers for the quantifiers: one which is objectual, but which does not make use of the notion of an assignment to a free variable. (shrink)

Neo-Fregeans argue that substantial mathematics can be derived from a priori abstraction principles, Hume's Principle connecting numerical identities with one:one correspondences being a prominent example. The embarrassment of riches objection is that there is a plurality of consistent but pairwise inconsistent abstraction principles, thus not all consistent abstractions can be true. This paper considers and criticizes various further criteria on acceptable abstractions proposed by Wright settling on another one—stability—as the best bet for neo-Fregeans. However, an analogue of the embarrassment of (...) riches objection resurfaces in the metatheory and I conclude by arguing that the neo-Fregean program, at least insofar as it includes a platonistic ontology, is fatally wounded by it. (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 essay consists of two parts. In the first part, I focus my attention on the remarks that Frege makes on consistency when he sets about criticizing the method of creating new numbers through definition or abstraction. This gives me the opportunity to comment also a little on H. Hankel, J. Thomae—Frege’s main targets when he comes to criticize “formal theories of arithmetic” in Die Grundlagen der Arithmetik (1884) and the second volume of Grundgesetze der Arithmetik (1903)—G. Cantor, L. E. (...) J. Brouwer and D. Hilbert (1899). Part 2 is mainly devoted to Hilbert’s proof theory of the 1920s (1922–1931). I begin with an account of his early attempt to prove directly, and thus not by reduction or by constructing a model, the consistency of (a fragment of) arithmetic. In subsequent sections, I give a kind of overview of Hilbert’s metamathematics of the 1920s and try to shed light on a number of difficulties to which it gives rise. One serious difficulty that I discuss is the fact, widely ignored in the pertinent literature on Hilbert’s programme, that his language of finitist metamathematics fails to supply the conceptual resources for formulating a consistency statement qua unbounded quantification. Along the way, I shall comment on W. W. Tait’s objection to an interpretation of Hilbert’s finitism by Niebergall and Schirn, on G. Gentzen’s allegedly finitist consistency proof for Peano Arithmetic as well as his ideas on the provability and unprovability of initial cases of transfinite induction in pure number theory. Another topic I deal with is what has come to be known as partial realizations of Hilbert’s programme, chiefly advocated by S. G. Simpson. Towards the end of this essay, I take a critical look at Wittgenstein’s views about (in)consistency and consistency proofs in the period 1929–1933. I argue that both his insouciant attitude towards the emergence of a contradiction in a calculus and his outright repudiation of metamathematical consistency proofs are unwarranted. In particular, I argue that Wittgenstein falls short of making a convincing case against Hilbert’s programme. I conclude with some philosophical remarks on consistency proofs and soundness and raise a question concerning the consistency of analysis. (shrink)

Parsons has given a (nonconstructive) proof that the first-order fragment of the system of Frege's Grundgesetze is consistent. Here a constructive proof of the same result is presented.

We show that the untyped λ -calculus can be extended with Frege's interpretation of propositional notions, provided we restrict β -conversion to positive expressions. The system of illative λ -calculus so obtained admits a natural Scott-style semantics.

In this paper, the authors discuss Frege's theory of "logical objects" and the recent attempts to rehabilitate it. We show that the 'eta' relation George Boolos deployed on Frege's behalf is similar, if not identical, to the encoding mode of predication that underlies the theory of abstract objects. Whereas Boolos accepted unrestricted Comprehension for Properties and used the 'eta' relation to assert the existence of logical objects under certain highly restricted conditions, the theory of abstract objects uses unrestricted Comprehension for (...) Logical Objects and banishes encoding formulas from Comprehension for Properties. The relative mathematical and philosophical strengths of the two theories are discussed. Along the way, new results in the theory of abstract objects are described, involving: the theory of extensions, the theory of directions and shapes, and the theory of truth values. (shrink)

Philosophers often explain what could be the case in terms of what is, in fact, the case at one possible world or another. They may differ in what they take possible worlds to be or in their gloss of what is for something to be the case at a possible world. Still, they stand united by the threat of paradox. A family of paradoxes akin to the set-theoretic antinomies seem to allow one to derive a contradiction from apparently plausible principles. (...) Some of them concern the interaction between propositions and worlds, and they appear to afford the means to map classes of propositions into propositions – or, likewise, classes of worlds into worlds – in a one-to-one fashion that leads to contradiction. Yet another family of paradoxes threaten the view that whatever could exist does, in fact, exist, which is in line with modal realism, for example. This article aims to survey and identify the source of each family of paradoxes as well as to outline some responses to them. (shrink)

We provide an overview of consistent fragments of the theory of Frege’s Grundgesetze der Arithmetik that arise by restricting the second-order comprehension schema. We discuss how such theories avoid inconsistency and show how the reasoning underlying Russell’s paradox can be put to use in an investigation of these fragments.

Frege’s Grundgesetze der Arithmetik is formally inconsistent. This system is, except for minor differences, second-order logic together with an abstraction operator governed by Frege’s Axiom V. A few years ago, Richard Heck showed that the ramified predicative second-order fragment of the Grundgesetze is consistent. In this paper, we show that the above fragment augmented with the axiom of reducibility for concepts true of only finitely many individuals is still consistent, and that elementary Peano arithmetic (and more) is interpretable in this (...) extended system. (shrink)

Frege’s theory is inconsistent. However, the predicative version of Frege’s system is consistent. This was proved by Richard Heck in 1996 using a model-theoretic argument. In this paper, we give a finitistic proof of this consistency result. As a consequence, Heck’s predicative theory is rather weak. We also prove the finitistic consistency of the extension of Heck’s theory to $\Delta^{1}_{1}$-comprehension and of Heck’s ramified predicative second-order system.

In this paper, I consider two curious subsystems ofFrege's Grundgesetze der Arithmetik: Richard Heck's predicative fragment H, consisting of schema V together with predicative second-order comprehension (in a language containing a syntactical abstraction operator), and a theory T in monadic second-order logic, consisting of axiom V and 1 1-comprehension (in a language containing anabstraction function). I provide a consistency proof for the latter theory, thereby refuting a version of a conjecture by Heck. It is shown that both Heck and T (...) prove the existence of infinitely many non-logical objects (T deriving,moreover, the nonexistence of the value-range concept). Some implications concerning the interpretation of Frege's proof of referentiality and the possibility of classifying any of these subsystems as logicist are discussed. Finally, I explore the relation of T toCantor's theorem which is somewhat surprising. (shrink)