Skip to main content

A Modern Rigorous Approach to Stratification in NF/NFU

Abstract

The main feature of NF/NFU is the notion of stratification, which sets it apart from other set theories. We define stratification and prove constructively that every stratified formula has the (unique) least assignment of types. The basic notion of stratification is concerned only with variables, but we extend it to abstraction terms in order to simplify further development. We reflect on nested abstraction terms, proving that they get the expected types. These extensions enable us to check whether some complex formula is stratified without rewriting it in the basic language. We also introduce natural numbers and a variant of the axiom of infinity, in order to precisely introduce type level ordered pairs, which are crucial in simplifying the definitions in the last part of the article. Using these notions we can easily define the sets of ordinal and cardinal numbers, which we show at the end of the article. The same approach can be readily applied to NF.

This is a preview of subscription content, access via your institution.

References

  1. Beeson, M.: The Church numbers in NF set theory (2021). arXiv:2108.09270

  2. Beeson, M.: Intuitionistic NF Set Theory (2021). arXiv:2104.00506

  3. Forster, T.E.: Set Theory with a Universal Set: Exploring an Untyped Universe. Oxford University Press, Oxford (1995)

    MATH  Google Scholar 

  4. Forster, T.E.: A tutorial on constructive NF. In: Proceedings of the 70th Anniversary NF Meeting in Cambridge, vol. 16 (2009)

  5. Frege, G.: Begriffsschrift, a formula language, modeled upon that of arithmetic, for pure thought. In: van Heijenoort, J. (ed.) From Frege to Gödel: A Source Book in Mathematical Logic, pp. 1897–1931. Harvard University Press, Cambridge (2002)

    Google Scholar 

  6. Holmes, M.R.: A new pass at the NF consistency proof (2020). https://randall-holmes.github.io/Nfproof/newattempt.pdf

  7. Holmes, M.R.: Elementary set theory with a universal set (1998). http://www.logic-center.be/cahiers/Copies/CCL10.pdf

  8. Holmes, M.R.: Proof, Sets, and Logic, pp. 85–86. Boise State University (2009). http://math.boisestate.edu/~holmes/indstudy/proofsetslogic.pdf

  9. Jensen, R.B.: On the consistency of a slight (?) modification of Quine’s new foundations. In: Hintikka, J. (ed.) Words and Objections: Essays on the Work of W. V. Quine. Springer, Berlin (1969)

    Google Scholar 

  10. Krantz, S.G.: Handbook of Logic and Proof Techniques for Computer Science. Springer, Berlin (2002)

    Book  Google Scholar 

  11. Morris, S.: Quine, New Foundations, and the Philosophy of Set Theory. Cambridge University Press, Cambridge (2018)

    Book  Google Scholar 

  12. Quine, W.V.: New foundations for mathematical logic. Am. Math. Mon. 44(2), 70–80 (1937)

    MathSciNet  Article  Google Scholar 

  13. Rosser, J.B.: Logic for Mathematicians. Dover Publications, Mineola (2008)

    MATH  Google Scholar 

  14. Russell, B., Whitehead, A.N.: Principia Mathematica (1910, 1912, 1913)

  15. Specker, E.P.: The axiom of choice in Quine’s new foundations for mathematical logic. Proc. Natl. Acad. Sci. U.S.A. 39, 972–975 (1953)

    MathSciNet  Article  Google Scholar 

Download references

Acknowledgements

We would like to express our gratitude to Jason Block from CUNY Graduate Center for copy editing this article, and to Tin Perkov for providing us with useful comments and suggestions. This work was supported by the Croatian Science Foundation under projects IP-2018-01-7459 (CompStruct) and UIP-2017-05-9219 (FORMALS).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tin Adlešić.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Adlešić, T., Čačić, V. A Modern Rigorous Approach to Stratification in NF/NFU. Log. Univers. (2022). https://doi.org/10.1007/s11787-022-00310-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11787-022-00310-y

Keywords

  • New foundations
  • Stratification
  • Abstraction terms
  • Type theory

Mathematics Subject Classification

  • Primary 03E20
  • Secondary 03-02
  • 03-08