25Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which explores the limits of different foundations for mathematics in a formally precise manner. This paper gives a detailed account of the motivations and methodology of foundational analysis, which have heretofore been largely left implicit in the p…Read more
24Set existence principles and closure conditions: unravelling the standard view of reverse mathematicsPhilosophia Mathematica. forthcoming.It is a striking fact from reverse mathematics that almost all theorems of countable and countably representable mathematics are equivalent to just five subsystems of second order arithmetic. The standard view is that the significance of these equivalences lies in the set existence principles that are necessary and sufficient to prove those theorems. In this article I analyse the role of set existence principles in reverse mathematics, and argue that they are best understood as closure condition…Read more
27TarskiIn Alex Malpass & Marianna Antonutti Marfori (eds.), The History of Philosophical and Formal Logic: From Aristotle to Tarski, Bloomsbury. pp. 293-313. 2017.Alfred Tarski was one of the greatest logicians of the twentieth century. His influence comes not merely through his own work but from the legion of students who pursued his projects, both in Poland and Berkeley. This chapter focuses on three key areas of Tarski's research, beginning with his groundbreaking studies of the concept of truth. Tarski's work led to the creation of the area of mathematical logic known as model theory and prefigured semantic approaches in the philosophy of language and…Read more
19Review of Denis R. Hirschfeldt, Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles (review)Studia Logica 105 (4): 873-879. 2017.The present volume is an introduction to the use of tools from computability theory and reverse mathematics to study combinatorial principles, in particular Ramsey's theorem and special cases such as Ramsey's theorem for pairs. It would serve as an excellent textbook for graduate students who have completed a course on computability theory.
Ludwig Maximilians Universität, MünchenMunich Centre for Mathematical PhilosophyPostdoctoral Fellow
Department of Philosophy
Munich, Bayern, Germany