We review Solomon Feferman's 1998 essay collection In The Light of Logic (Oxford University Press).

Both the constructive and predicative approaches to mathematics arose during the period of what was felt to be a foundational crisis in the early part of this century. Each critiqued an essential logical aspect of classical mathematics, namely concerning the unrestricted use of the law of excluded middle on the one hand, and of apparently circular \impredicative" de nitions on the other. But the positive redevelopment of mathematics along constructive, resp. predicative grounds did not emerge as really viable alternatives to (...) classical, set-theoretically based mathematics until the 1960s. Now we have a massive amount of information, to which this lecture will constitute an introduction, about what can be done by what means, and about the theoretical interrelationships between various formal systems for constructive, predicative and classical analysis. (shrink)

The purpose of this note is to demonstrate that predicative Frege arithmetic naturally interprets some weak but non-trivial arithmetical theories. The weak theories in question are all related to Tarski, Mostowski, and Robinson's R. In saying that the interpretation is "natural", I mean that it relies only upon "definitions" of arithmetical notions that are themselves "natural", that is, that have some claim to be "definitions" in something other than a purely formal sense.

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

As is well-known, the formal system in which Frege works in his Grundgesetze der Arithmetik is formally inconsistent, Russell?s Paradox being derivable in it.This system is, except for minor differences, full second-order logic, augmented by a single non-logical axiom, Frege?s Axiom V. It has been known for some time now that the first-order fragment of the theory is consistent. The present paper establishes that both the simple and the ramified predicative second-order fragments are consistent, and that Robinson arithmetic, Q, is (...) relatively interpretable in the simple predicative fragment. The philosophical significance of the result is discussed. (shrink)

Predicativity requirements of explicit presentability of objects and predicatively acceptable proof are distinguished from predicativist theses of a philosophical character. Familiar among these are expressions of skepticism about the objectivity of full power sets of infinite sets. Articulation of strong, limitative theses, however, turns out to be problematic: impredicative commitments creep into the very formulations, e.g. that “predicative definability'' marks a limit of “intelligibility''. A thought experiment is proposed to undermine the predicativist idea that arbitrary parts of an infinite whole (...) of atoms are “mind- or language-dependent''. On the other hand, weaker claims, e.g., that predicative mathematics is “more secure'' than impredicative, are nearly platitudinous. The interesting philosophical force of predicativism seems to be negative, in its challenge to indispensability arguments, à la Gödel-Friedman, for the transfinite in pure mathematics, and à la Quine-Putnam, for abstract mathematics in the sciences. Evidence is mounting in favor of Gödel-Friedman, e.g. impredicativity of free-variable formulations of theorems such as Kruskal's and Graph Minor, and more far-reaching, recent work in Boolean Relation Theory. This may lead to a realization of Gödel's idea of justifying strong axioms of infinity through their unifying, explanatory role, in analogy with theoretical physics. (shrink)

Hilbert’s program in the philosophy of mathematics comes in two parts. One part is a technical part. To carry out this part of the program one has to prove a certain technical result. The other part of the program is a philosophical part. It is concerned with philosophical questions that are the real aim of the program. To carry out this part one, basically, has to show why the technical part answers the philosophical questions one wanted to have answered. Hilbert (...) probably thought that he had completed the philosophical part of his program, maybe up to a few details. What was left to do was the technical part. To carry it out one, roughly, had to give a precise axiomatization of mathematics and show that it is consistent on purely finitistic grounds. This would come down to giving a relative consistency proof of mathematics in finitist mathematics, or to give a proof-theoretic reduction of mathematics on to finitist mathematics (we will look at these notions in more detail soon). It is widely believed that Gödel’s theorems showed that the technical part of Hilbert’s program could not be carried out. Gödel’s theorems show that the consistency of arithmetic can not even be proven in arithmetic, not to speak of by finitistic means alone. So, the technical part of Hilbert’s program is hopeless, and since Hilbert’s program essentially relied on both the technical and the philosophical part, Hilbert’s program as a whole is hopeless. Justified as this attitude is, it is a bit unfortunate. It is unfortunate because it takes away too much attention from the philosophical part of Hilbert’s program. And this is unfortunate for two reasons. (shrink)

By combining some technical results from metamathematicalinvestigations of systems of Bounded Arithmetic, I will givean argument for the untenability of Nelson's finitistic program,encapsulated in his book Predicative Arithmetic.

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)