is a fragment of first-order aritlimetic so weak that it cannot prove the totality of an iterated exponential fimction. Surprisingly, however, the theory is remarkably robust. I will discuss formal results that show that many theorems of number theory and combinatorics are derivable in elementary arithmetic, and try to place these results in a broader philosophical context.

This paper discusses the notion of necessity in the light of results from contemporary mathematical practice. Two descriptions of necessity are considered. According to the first, necessarily true statements are true because they describe ‘unchangeable properties of unchangeable objects’. The result that I present is argued to provide a counterexample to this description, as it concerns a case where objects are moved from one category to another in order to change the properties of these objects. The second description concerns necessary (...) ‘structural properties’. Although I grant that mathematical statements could be considered as necessarily true in this sense, I question whether this justifies the claim that mathematics as a whole is necessary. (shrink)