论文标题
分层理解的简短公理化
Short Axiomatization of Stratified Comprehension
论文作者
论文摘要
分层理解有几个有限的公理。著名的两个是Hailperin's和Randall Holmes的。但是，这里介绍的系统可能是以设定理论的一阶语言写的最短的系统。与使用有序对的先前的公理瘤不同，该公理化使用了无序的对，因此，这使得在集合理论的一阶语言中变得更简单。证明在没有扩展性的情况下起作用，因此可以完成NFU或NF的公理化。
There are several finite axiomatizations of stratified comprehension. The famous two are Hailperin's and Randall Holmes's. However, the system presented here could be the shortest known one written in the first order language of set theory. This axiomatization uses unordered pairs, unlike the prior axiomaizations which used ordered pairs, so this makes a simpler formulation in the first order language of set theory. The proof works under absence of Extensionality, so it can serve to complete an axiomatization of NFU or NF.
