We use NF to designate the system known as Quine's New Foundations, and NF + AF to designate the same system with a suitable axiom of infinity adjoined. We use ML to designate the revised system appearing in the third printing of Quine's “Mathematical Logic”. This system ML is just the systemPproposed by Wang in [4], and essentially includes NF as a part.The pripcipal results of the present paper are:A. In NF the axiom of infinity is equivalent to the definability (...) of an ordered pair having the same type as its constituents.B. Considering the formulas of NF as having translations in the formalism of ML in the sense defined in [4], we find that a formula of NF is provable in NF if and only if its translation is provable in ML. From the fact that the axiom of infinity is provable in ML, one might be tempted to conclude that the axiom of infinity is provable in NF. It is explained why this is not a valid inference. Consequently, it would appear that there is a sense in which NF + AF is stronger than ML. (shrink)