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)

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)

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)

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)

Wright claims that “the epistemology of good abstraction principles should be assimilated to that of basic principles of logical inference”. In this paper I follow Wright’s recommendation, but I consider a different epistemology of logic, namely anti-exceptionalism. Anti-exceptionalism’s main contention is that logic is not a priori, and that the choice between rival logics should be based on abductive criteria such as simplicity, adequacy to the data, strength, fruitfulness, and consistency. This paper’s goal is to lay down the foundations for (...) an application of the anti-exceptionalist methodology to abstraction principles. In Sect. 1 I outline my strategy. I show that anti-exceptionalism has a bearing on the so-called Bad Company problem, and explore some versions of anti-exceptionalism about abstraction. I then consider new criteria for choosing between rival abstraction principles, and, in particular, between consistent revisions of Frege’s Basic Law V. I finally consider how the abstractionist can compare between competing criteria, and argue that anti-exceptionalists should be pluralists about abstraction. (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)

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)

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)

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)

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)

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)

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)

Thought: A Journal of Philosophy, EarlyView.

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)

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)

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)

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)

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)

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)

Assertion plays a crucial dual role in Frege's conception of logic, a formal and a transcendental one. A recurrent complaint is that Frege's inclusion of the judgement-stroke in the Begriffsschrift is either in tension with his anti-psychologism or wholly superfluous. Assertion, the objection goes, is at best of merely psychological significance. In this paper, I defend Frege against the objection by giving reasons for recognising the central logical significance of assertion in both its formal and its transcendental role.

Frege’s _Basic Law V_ is inconsistent. The reason often given is that it posits the existence of an injection from the larger collection of first-order concepts to the smaller collection of objects. This article explains what is right and what is wrong with this diagnosis.

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)

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)

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)

Kripke showed how to restrict Tarski’s schema to grounded sentences. I examine the prospects for an analogous approach to the paradoxes of naive class comprehension. I present new methods to obtain theories of grounded classes and test them against antecedently motivated desiderata. My findings cast doubt on whether a theory of grounded classes can accommodate both the extensionality of classes and allow for class definition in terms of identity.

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.

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)

A remembrance of Dummett's work on philosophy of mathematcis.

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)

We discuss the typography of the notation used by Gottlob Frege in his Grundgesetze der Arithmetik.

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.

The paradox that appears under Burali-Forti’s name in many textbooks of set theory is a clever piece of reasoning leading to an unproblematic theorem. The theorem asserts that the ordinals do not form a set. For such a set would be—absurdly—an ordinal greater than any ordinal in the set of all ordinals. In this article, we argue that the paradox of Burali-Forti is first and foremost a problem about concept formation by abstraction, not about sets. We contend, furthermore, that some (...) hundred years after its discovery the paradox is still without any fully satisfactory resolution. A survey of the current literature reveals one key assumption of the paradox that has gone unquestioned, namely the assumption that ordinals are objects. Taking the lead from Russell’s no class theory, we interpret talk of ordinals as an efficient way of conveying higher-order logical truths. The resulting theory of ordinals is formally adequate to standard intuitions about ordinals, expresses a conception of ordinal number capable of resolving Burali-Forti’s paradox, and offers a novel contribution to the longstanding program of reducing mathematics to higher-order logic. (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)

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 Δ11-comprehension (...) schema would already be inconsistent. In the present paper, we show that this is not the case. (shrink)

I reconcile the spatiotemporal location of repeatable artworks and impure sets with the non-location of natural numbers despite all three being varieties of abstract objects. This is possible because, while the identity conditions for all three can be given by abstraction principles, in the former two cases spatiotemporal location is a congruence for the equivalence relation featuring in the relevant principle, whereas in the latter it is not. I then generalize this to other ‘physical’ properties like shape, mass, and causal (...) powers. (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.

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)

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)

Inspired by Cantor's Theorem (CT), orthodoxy takes infinities to come in different sizes. The orthodox view has had enormous influence in mathematics, philosophy, and science. We will defend the contrary view---Countablism---according to which, necessarily, every infinite collection (set or plurality) is countable. We first argue that the potentialist or modal strategy for treating Russell's Paradox, first proposed by Parsons (2000) and developed by Linnebo (2010, 2013) and Linnebo and Shapiro (2019), should also be applied to CT, in a way that (...) vindicates Countabilism. Our discussion dovetails with recent independently developed treatments of CT in Meadows (2015), Pruss (2020), and Scambler (2021), aimed at establishing the mathematical viability, and therefore epistemic possibility, of Countabilism. Unlike these authors, our goal isn't to vindicate the mathematical underpinnings of Countabilism. Rather, we aim to argue that, given that Countabilism is mathematically viable, Countabilism should moreover be regarded as true. After clarifying the modal content of Countabilism, we canvas some of Countabilism's many positive implications, including that Countabilism provides the best account of the pervasive independence phenomena in set theory, and that Countabilism has the power to defuse several persistent puzzles and paradoxes found in physics and metaphysics. We conclude that in light of its theoretical and explanatory advantages, Countabilism is more likely true than not. (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 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.

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.

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)

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)