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)

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)

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)

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)

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 logicist program requires that arithmetic be reduced to logic. Such a program has recently been revamped by the "neologicist" approach of Hale and Wright. Less attention has been given to Frege's extensionalist program, according to which arithmetic is to be reconstructed in terms of a theory of extensions of concepts. This paper deals just with such a theory. We present a system of second-order logic augmented with a predicate representing the fact that an object x is the extension of (...) a concept C, together with extra-logical axioms governing such a predicate, and show that arithmetic can be obtained in such a framework. As a philosophical payoff, we investigate the status of the so-called Hume's Principle and its connections to the root of the contradiction in Frege's system. (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)

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 paper dates from about 1994: I rediscovered it on my hard drive in the spring of 2002. It represents an early attempt to explore the connections between the Julius Caesar problem and Frege's attitude towards Basic Law V. Most of the issues discussed here are ones treated rather differently in my more recent papers "The Julius Caesar Objection" and "Grundgesetze der Arithmetik I 10". But the treatment here is more accessible, in many ways, providing more context and a better (...) sense of how this issue relates to broader issues in Frege's philosophy. (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)

PG (Plural Grundgesetze) is a predicative monadic second-order system which exploits the notion of plural quantification and a few Fregean devices, among which a formulation of the infamous Basic Law V. It is shown that second-order Peano arithmetic can be derived in PG. I also investigate the philosophical issue of predicativism connected to PG. In particular, as predicativism about concepts seems rather un-Fregean, I analyse whether there is a way to make predicativism compatible with Frege’s logicism.

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)

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)

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)

Thought: A Journal of Philosophy, EarlyView.

I present the traditional debate about the so called explanation of Russell’s paradox and propose a new way to solve the contradiction that arises in Frege’s system. I briefly examine two alternative explanatory proposals—the Predicativist explanation and the Cantorian one—presupposed by almost all the proposed solutions of Russell’s Paradox. From the discussion about these proposals a controversial conclusion emerges. Then, I examine some particular zig zag solutions and I propose a third explanation, presupposed by them, in which I emphasise the (...) role of an implicit premise in the derivation of the paradox. In conclusion, I propose a different zig zag solution obtained by the adoption of a negative free logic. (shrink)

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)

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)

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)

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.

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)

In [Boccuni 2010], a predicative fragment of Frege’s blv augmented with Boolos’ unrestricted plural quantification is shown to interpret pa2. The main disadvantage of that axiomatisation is that it does not recover Frege Arithmetic fa because of the restrictions imposed on the axioms. The aim of the present article is to show how [Boccuni 2010] can be consistently extended so as to interpret fa and consequently pa2 in a way that parallels Frege’s. In that way, the presented system will be (...) compared with the system pe in [Ferreira 2018] and some relevant differences between the two will be highlighted. (shrink)

PG (Plural Grundgesetze) is a predicative monadic second-order system which is aimed to derive second-order Peano arithmetic. It exploits the notion of plural quantification and a few Fregean devices, among which the infamous Basic Law V. In this paper, a model-theoretical consistency proof for the system PG is provided.