Transfinite recursion is an essential component of set theory. In this paper, we seek intrinsically justified reasons for believing in recursion and the notions of higher computation that surround it. In doing this, we consider several kinds of recursion principles and prove results concerning their relation to one another. We then consider philosophical motivations for these formal principles coming from the idea that computational notions lie at the core of our conception of set. This is significant because, while the iterative (...) conception of set has been widely recognized as insufficient to establish replacement and recursion, its supplementation by considerations pertaining to algorithms suggests a new and philosophically well-motivated reason to believe in such principles. (shrink)

This paper has a two-fold objective: to provide a balanced, multi-faceted account of the origins of logicism; to rehabilitate Richard Dedekind as a main logicist. Logicism should be seen as more deeply rooted in the development of modern mathematics than typically assumed, and this becomes evident by reconsidering Dedekind's writings in relation to Frege's. Especially in its Dedekindian and Fregean versions, logicism constitutes the culmination of the rise of ?pure mathematics? in the nineteenth century; and this rise brought with it (...) an inter-weaving of methodological and epistemological considerations. The latter aspect illustrates how philosophical concerns can grow out of mathematical practice, as opposed to being imposed on it from outside. It also sheds new light on the legacy and the lasting significance of logicism today. (shrink)