The two expressions 'The cumulative hierarchy' and 'The iterative conception of sets' are usually taken to be synonymous. However, the second is more general than the first, in that there are recursive procedures that generate some ill-founded sets in addition to well-founded sets. The interesting question is whether or not the arguments in favour of the more restrictive version - the cumulative hierarchy - were all along arguments for the more general version. The phrase 'The iterative conception of sets' conjures up a picture of a particular set- theoretic universe - the cumulative hierarchy - and the constant conjunction of phrase- with-picture is so reliable that people tend to think that the cumulative hierarchy is all there is to the iterative conception of sets: if you conceive sets iteratively, then the result is the cumulative hierarchy. In this paper, I shall be arguing that this is a mistake: the iterative conception of set is a good one, for all the usual reasons. However, the cumulative hierarchy is merely one way among many of working out this conception, and arguments in favour of an iterative conception have been mistaken for arguments in favour of this one special instance of it. (This may be the point to get out of the way the observation that although philosophers of mathematics write of the iterative conception of set, what they really mean - in the terminology of modern computer science at least - is the recursive conception of sets. Nevertheless, having got that quibble off my chest, I shall continue to write of the iterative conception like everyone else.)
[1]
G. Boolos,et al.
The Iterative Conception of Set
,
1971
.
[2]
Alonzo Church,et al.
Set Theory with a Universal Set
,
1974
.
[3]
F. Honsell,et al.
Set theory with free construction principles
,
1983
.
[4]
J. Conway.
On Numbers and Games
,
1976
.
[5]
W. Quine.
Speaking of Objects
,
1957
.
[6]
Thomas E. Forster.
Logic, Induction and Sets
,
2003,
London Mathematical Society student texts.
[7]
Olivier Esser.
On the Consistency of a Positive Theory
,
1999,
Math. Log. Q..