A note on the schemes of replacement and collection (Q866884)

The author investigates the axiom scheme Repcoll which is in some sense similar to Replacement and Collection. Repcoll consists of implications with hypotheses that are stronger than those of Collection and conclusions that are weaker than those of Replacement. This scheme is investigated in the theories \(M_0\) and \(M_1\), where the axioms of \(M_0\) are Extensionality, Null Set, Pairing, Sumset, Power Set, and the scheme of \(\Delta_0\) Separation. The axioms of \(M_1\) are those of \(M_0\) together with Foundation and the principle TCo of Transitive Containment which asserts that every set is a member of a transitive set. Answering a question of Simpson the author shows that all extensions of ZF except the axiom of infinity are provable in \(M_1\) + Repcoll but not in certain weakenings of that system. To obtain this result the author starts by showing that every set has a rank. By an induction on the complexity of formulas he derives all instances of the schemes of Separation and Collection.