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)

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 ...

What is a logical constant? The question is addressed in the tradition of Tarski's definition of logical operations as operations which are invariant under permutation. The paper introduces a general setting in which invariance criteria for logical operations can be compared and argues for invariance under potential isomorphism as the most natural characterization of logical operations.

This paper presents a formalization of first-order arithmetic characterizing the natural numbers as abstracta of the equinumerosity relation. The formalization turns on the interaction of a nonstandard cardinality quantifier with an abstraction operator assigning objects to predicates. The project draws its philosophical motivation from a nonreductionist conception of logicism, a deflationary view of abstraction, and an approach to formal arithmetic that emphasizes the cardinal properties of the natural numbers over the structural ones.

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)

It is widely supposed that every entity falls into one of twocategories: Some are concrete; the rest abstract. The distinction issupposed to be of fundamental significance for metaphysics andepistemology. This article surveys a number of recent attempts to sayhow it should be drawn.

The epsilon calculus is a logical formalism developed by David Hilbert in the service of his program in the foundations of mathematics. The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. Specifically, in the calculus, a term εx A denotes some x satisfying A(x), if there is one. In Hilbert's Program, the epsilon terms play the role of ideal elements; the aim of Hilbert's finitistic consistency proofs is to give a procedure which removes such terms (...) from a formal proof. The procedures by which this is to be carried out are based on Hilbert's epsilon substitution method. The epsilon calculus, however, has applications in other contexts as well. The first general application of the epsilon calculus was in Hilbert's epsilon theorems, which in turn provide the basis for the first correct proof of Herbrand's theorem. More recently, variants of the epsilon operator have been applied in linguistics and linguistic philosophy to deal with anaphoric pronouns. (shrink)

I ON THE PRIMITIVE TERM OF LOGISTICf IN this article I propose to establish a theorem belonging to logistic concerning some connexions, not widely known, ...

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 this manuscript, published here for the first time, Tarski explores the concept of logical notion. He draws on Klein's Erlanger Programm to locate the logical notions of ordinary geometry as those invariant under all transformations of space. Generalizing, he explicates the concept of logical notion of an arbitrary discipline.

Syntactic Reductionism, as understood here, is the view that the ‘logical forms’ of sentences in which reference to abstract objects appears to be made are misleading so that, on analysis, we can see that no expressions which even purport to refer to abstract objects are present in such sentences. After exploring the motivation for such a view, and arguing that no previous argument against it succeeds, sentences involving generalized quantifiers, such as ‘most’, are examined. It is then argued, on this (...) basis, that Syntactic Reductionism is untenable. (shrink)

Tarski and Mautner proposed to characterize the "logical" operations on a given domain as those invariant under arbitrary permutations. These operations are the ones that can be obtained as combinations of the operations on the following list: identity; substitution of variables; negation; finite or infinite disjunction; and existential quantification with respect to a finite or infinite block of variables. Inasmuch as every operation on this list is intuitively "logical", this lends support to the Tarski-Mautner proposal.

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)

Richard G. Heck, On the Philosophical Significance of Frege's Theorem. Language, Thought, and Logic, Essays in Honour of Michael Dummett.George Boolos, Is Hume's Principle Analytic?.Charles Parsons, Wright onion and Set Theory.Richard G. Heck, The Julius Caesar Objection.