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 φ(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 PA2. (shrink)

Predicativity is a notable example of fruitful interaction between philosophy and mathematical logic. It originated at the beginning of the 20th century from methodological and philosophical reflections on a changing concept of set. A clarification of this notion has prompted the development of fundamental new technical instruments, from Russell's type theory to an important chapter in proof theory, which saw the decisive involvement of Kreisel, Feferman and Schütte. The technical outcomes of predica-tivity have since taken a life of their own, (...) but have also produced a deeper understanding of the notion of predicativity, therefore witnessing the " light logic throws on problems in the foundations of mathematics. " (Feferman 1998, p. vii) Predicativity has been at the center of a considerable part of Feferman's work: over the years he has explored alternative ways of explicating and analyzing this notion and has shown that predicative mathematics extends much further than expected within ordinary mathematics. The aim of this note is to outline the principal features of predicativity, from its original motivations at the start of the past century to its logical analysis in the 1950-60's. The hope is to convey why predicativity is a fascinating subject, which has attracted Feferman's attention over the years. (shrink)

Tarski, Carnap and Quine spent the academic year 1940?1941 together at Harvard. In their autobiographies, both Carnap and Quine highlight the importance of the conversations that took place among them during the year. These conversations centred around semantical issues related to the analytic/synthetic distinction and on the project of a finitist/nominalist construction of mathematics and science. Carnap's Nachlaß in Pittsburgh contains a set of detailed notes, amounting to more than 80 typescripted pages, taken by Carnap while these discussions were taking (...) place. In my article, I present a survey of these notes with special emphasis on Tarski's rejection of the analytic/synthetic distinction, the passage from typed languages to first-order languages, Tarski's finitism/nominalism, and the construction of a finitist language for mathematics and science. (shrink)

A variety of projects in proof theory of relevance to the philosophy of mathematics are surveyed, including Gödel's incompleteness theorems, conservation results, independence results, ordinal analysis, predicativity, reverse mathematics, speed-up results, and provability logics.

In the literature, predicativism is connected not only with the Vicious Circle Principle but also with the idea that certain totalities are inherently potential. To explain the connection between these two aspects of predicativism, we explore some approaches to predicativity within the modal framework for potentiality developed in Linnebo (2013) and Linnebo and Shapiro (2019). This puts predicativism into a more general framework and helps to sharpen some of its key theses.

Recent work on formal theories of truth has revived an approach, due originally to Tarski, on which syntax and truth theories are sharply distinguished—‘disentangled’—from mathematical base theories. In this paper, we defend a novel philosophical constraint on disentangled theories. We argue that these theories must be epistemically stable: they must possess an intrinsic motivation justifying no strictly stronger theory. In a disentangled setting, even if the base and the syntax theory are individually stable, they may be jointly unstable. We contend (...) that this flaw afflicts many proposals discussed in the literature; we defend a new, stable disentangled theory, double second-order arithmetic. (shrink)