March | 2010 | Internet Encyclopedia of Philosophy
Consider first the case of a finite set, say a set S with n elements. By means of what Bernays calls "combinatorial reasoning"—that is, reasoning based on the grouping and selecting objects—we establish that S has 2 n subsets. We establish this by observing that all the different subsets of S correspond to all the different ways of making ...