A collection of all but two of the author's philosophical essays and lectures originally published or presented before August 1976.

Mathematics is one of the most successful human endeavors—a paradigm of precision and objectivity. It is also one of our most puzzling endeavors, as it seems to deliver non-experiential knowledge of a non-physical reality consisting of numbers, sets, and functions. How can the success and objectivity of mathematics be reconciled with its puzzling features, which seem to set it apart from all the usual empirical sciences? This book offers a short but systematic introduction to the philosophy of mathematics. Readers are (...) introduced to all of the classical approaches to the field, including logicism, formalism, intuitionism, empiricism, and structuralism. The book also contains accessible introductions to some more specialized issues, such as mathematical intuition, potential infinity, the iterative conception of sets, and the search for new mathematical axioms. The exposition is always closely informed by ongoing research in the field and sometimes draws on the author’s own contributions to this research. This means that Gottlob Frege—a German mathematician and philosopher widely recognized as one of the founders of analytic philosophy—figures prominently in the book, both through his own views and his criticism of other thinkers. (shrink)

Given two (positive) equivalence relations ∼ 1 , ∼ 2 on the set ω of natural numbers, we say that ∼ 1 is m-reducible to ∼ 2 if there exists a total recursive function h such that for every x, y ∈ ω, we have $x \sim_1 y \operatorname{iff} hx \sim_2 hy$ . We prove that the equivalence relation induced in ω by a positive precomplete numeration is complete with respect to this reducibility (and, moreover, a "uniformity property" holds). This (...) result allows us to state a classification theorem for positive equivalence relations (Theorem 2). We show that there exist nonisomorphic positive equivalence relations which are complete with respect to the above reducibility; in particular, we discuss the provable equivalence of a strong enough theory: this relation is complete with respect to reducibility but it does not correspond to a precomplete numeration. From this fact we deduce that an equivalence relation on ω can be strongly represented by a formula (see Definition 8) iff it is positive. At last, we interpret the situation from a topological point of view. Among other things, we generalize a result of Visser by showing that the topological space corresponding to a partition in e.i. sets is irreducible and we prove that the set of equivalence classes of true sentences is dense in the Lindenbaum algebra of the theory. (shrink)