Repository | Journal | Volume | Articles
(2015) Synthese 192 (8).
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.
Publication details
DOI: 10.1007/s11229-014-0560-9
Full citation:
Rin, B. (2015). Transfinite recursion and computation in the iterative conception of set. Synthese 192 (8), pp. 2437-2462.
This document is unfortunately not available for download at the moment.