Abstract

A key idea in both Frege's development of arithmetic in theGrundlagen[7] and Zermelo's 1904 proof [10] of the well-ordering theorem is that of a “type reducing” correspondence between second-level and first-level entities. In Frege's construction, the correspondence obtains betweenconceptandnumber, in Zermelo's (through the axiom of choice), betweensetandmember. In this paper, a formulation is given and a detailed investigation undertaken of a system ℱ of many-sorted first-order logic (first outlined in the Appendix to [6]) in which this notion of type reducing correspondence is accorded a central role and which enables Frege's and Zermelo's constructions to be presented in such a way as to reveal their essential similarity. By adapting Bourbaki's version of Zermelo's proof of the well-ordering theorem, we show that, within ℱ, any correspondencecbetween second-level entities (here calledconcepts) and first-level ones (here calledobjects) induces a well-ordering relationW(c) in a canonical manner. We shall see that, whencis the “Fregean” correspondence between concepts and cardinal numbers,W(c) is (the well-ordering of) the ordinalω+ 1, and whencis a “Zermelian” choice function on concepts,W(c) is a well-ordering of the universal concept embracing all objects.In ℱ an important role is played by the notion ofextensionof a concept. To each conceptXwe assume there is assigned an objecte(X) in such a way that, for any conceptsX, Ysatisfying a certain predicateE, we havee(X) =e(Y) iff the same objects fall underXandY.