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.

The paper formulates and proves a strengthening of ‘Frege’s Theorem’, which states that axioms for second-order arithmetic are derivable in second-order logic from Hume’s Principle, which itself says that the number of Fs is the same as the number ofGs just in case the Fs and Gs are equinumerous. The improvement consists in restricting this claim to finite concepts, so that nothing is claimed about the circumstances under which infinite concepts have the same number. ‘Finite Hume’s Principle’ also suffices for (...) the derivation of axioms for arithmetic and, indeed, is equivalent to a version of them, in the presence of Frege’s definitions of the primitive expressions of the language of arithmetic. The philosophical significance of this result is also discussed. (shrink)

In this paper, we characterize the strength of the predicative Frege hierarchy, , introduced by John Burgess in his book [J. Burgess, Fixing frege, in: Princeton Monographs in Philosophy, Princeton University Press, Princeton, 2005]. We show that and are mutually interpretable. It follows that is mutually interpretable with Q. This fact was proved earlier by Mihai Ganea in [M. Ganea, Burgess’ PV is Robinson’s Q, The Journal of Symbolic Logic 72 619–624] using a different proof. Another consequence of the our (...) main result is that is mutually interpretable with Kalmar Arithmetic . The fact that interprets EA was proved earlier by Burgess. We provide a different proof. Each of the theories is finitely axiomatizable. Our main result implies that the whole hierarchy taken together, , is not finitely axiomatizable. What is more: no theory that is mutually locally interpretable with is finitely axiomatizable. (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)

Øystein Linnebo has recently shown that the existence of successors cannot be proven in predicative Frege arithmetic, using Frege’s definitions of arithmetical notions. By contrast, it is shown here that the existence of successor can be proven in ramified predicative Frege arithmetic.

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

The motivation for Core Logic is explained. Its system of proof is set out. It is then shown that, although the system has no Cut rule, its relation of deducibility obeys Cut with epistemic gain.

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)

This chapter examines the debate between advocates of classical logic and advocates of intuitionistic logic. It examines the semantic and epistemic issues on which this debate is usually conducted. After introducing the idea that logic is a model of correct reasoning, the chapter explores the viability of a logic intermediate between classical and intuitionistic.