In the 1920s, David Hilbert proposed a research program with the aim of providing mathematics with a secure foundation. This was to be accomplished by first formalizing logic and mathematics in their entirety, and then showing---using only so-called finitistic principles---that these formalizations are free of contradictions. ;In the area of logic, the Hilbert school accomplished major advances both in introducing new systems of logic, and in developing central metalogical notions, such as completeness and decidability. The analysis of unpublished material presented (...) in Chapter 2 shows that a completeness proof for propositional logic was found by Hilbert and his assistant Paul Bernays already in 1917--18, and that Bernays's contribution was much greater than is commonly acknowledged. Aside from logic, the main technical contribution of Hilbert's Program are the development of formal mathematical theories and proof-theoretical investigations thereof, in particular, consistency proofs. In this respect Wilhelm Ackermann's 1924 dissertation is a milestone both in the development of the Program and in proof theory in general. Ackermann gives a consistency proof for a second-order version of primitive recursive arithmetic which, surprisingly, explicitly uses a finitistic version of transfinite induction up to www . He also gave a faulty consistency proof for a system of second-order arithmetic based on Hilbert's &egr;-substitution method. Detailed analyses of both proofs in Chapter 3 shed light on the development of finitism and proof theory in the 1920s as practiced in Hilbert's school. ;In a series of papers, Charles Parsons has attempted to map out a notion of mathematical intuition which he also brings to bear on Hilbert's finitism. According to him, mathematical intuition fails to be able to underwrite the kind of intuitive knowledge Hilbert thought was attainable by the finitist. It is argued in Chapter 4 that the extent of finitistic knowledge which intuition can provide is broader than Parsons supposes. According to another influential analysis of finitism due to W. W. Tait, finitist reasoning coincides with primitive recursive reasoning. The acceptance of non-primitive recursive methods in Ackermann's dissertation presented in Chapter 3, together with additional textual evidence presented in Chapter 4, shows that this identification is untenable as far as Hilbert's conception of finitism is concerned. Tait's conception, however, differs from Hilbert's in important respects, yet it is also open to criticisms leading to the conclusion that finitism encompasses more than just primitive recursive reasoning. (shrink)

I develop a novel argument against the claim that ordinals are sets. In contrast to Benacerraf’s antireductionist argument, I make no use of covert epistemic assumptions. Instead, my argument uses considerations of ontological dependence. I draw on the datum that sets depend immediately and asymmetrically on their elements and argue that this datum is incompatible with reductionism, given plausible assumptions about the dependence profile of ordinals. In addition, I show that a structurally similar argument can be made against the claim (...) that cardinals are sets. (shrink)

Logic is usually thought to concern itself only with features that sentences and arguments possess in virtue of their logical structures or forms. The logical form of a sentence or argument is determined by its syntactic or semantic structure and by the placement of certain expressions called “logical constants.”[1] Thus, for example, the sentences Every boy loves some girl. and Some boy loves every girl. are thought to differ in logical form, even though they share a common syntactic and semantic (...) structure, because they differ in the placement of the logical constants “every” and “some”. By contrast, the sentences Every girl loves some boy. and Every boy loves some girl. are thought to have the same logical form, because “girl” and “boy” are not logical constants. Thus, in order to settle questions about logical form, and ultimately about which arguments are logically valid and which sentences logically true, we must distinguish the “logical constants” of a language from its nonlogical expressions. (shrink)

The philosophy of mathematics plays an important role in analytic philosophy, both as a subject of inquiry in its own right, and as an important landmark in the broader philosophical landscape. Mathematical knowledge has long been regarded as a paradigm of human knowledge with truths that are both necessary and certain, so giving an account of mathematical knowledge is an important part of epistemology. Mathematical objects like numbers and sets are archetypical examples of abstracta, since we treat such objects in (...) our discourse as though they are independent of time and space; finding a place for such objects in a broader framework of thought is a central task of ontology, or metaphysics. The rigor and precision of mathematical language depends on the fact that it is based on a limited vocabulary and very structured grammar, and semantic accounts of mathematical discourse often serve as a starting point for the philosophy of language. Although mathematical thought has exhibited a strong degree of stability through history, the practice has also evolved over time, and some developments have evoked controversy and debate; clarifying the basic goals of the practice and the methods that are appropriate to it is therefore an important foundational and methodological task, locating the philosophy of mathematics within the broader philosophy of science. (shrink)