← All papers
First page of Short Axiomatization of Stratified Comprehension

Short Axiomatization of Stratified Comprehension

Zuhair A. Al-Johar

math.LO Aug 25, 2020 · v4
The reductions from five set-existence axioms to the Holmes basis and to stratified comprehension are formalized and kernel-checked in Lean 4.24, and the Lean source is supplied.
Several finite axiomatizations of stratified comprehension are known. This paper gives five set existence principles which, in the presence of Extensionality, yield the fourteen set-construction principles used in the finite basis recorded by Holmes. In addition, a direct unordered proof is given showing that the same five principles, together with extensionality only for nonempty sets, already imply every stratified comprehension instance, without passing through the Holmes ordered-pair machinery. The displayed reductions for unordered products, Cartesian products, and ordered relative products have been corrected. The original Holmes-basis reduction and the new direct weak-extensionality development have been checked by the Lean 4 kernel; the complete Lean source is supplied with this version.

Several finite axiomatizations of stratified comprehension (as in NF/NFU) are known. The question is whether a smaller set of set existence principles suffices to derive the fourteen-point finite basis recorded by Holmes, and to derive stratified comprehension directly.

Five set existence principles are proposed. Under Extensionality they derive the fourteen Holmes set-construction principles (Sheffer stroke, unordered relative products, and similar constructions). A separate direct, unordered proof derives every stratified comprehension instance using only extensionality for nonempty sets, bypassing the ordered-pair machinery. Both developments are formalized in self-contained Lean 4 files, and a verification script checks for sorry, admit and custom axioms.

The five principles yield all fourteen Holmes basis points. With nonempty extensionality alone they imply stratified comprehension. Earlier displayed reductions for unordered, Cartesian and ordered relative products are corrected. Both developments compile in Lean 4.24 without sorry, admit or custom axioms.