Bulletin of the Belgian Mathematical Society - Simon Stevin

The quantifier complexity of {${\rm NF}$}

Richard Kaye

Full-text: Open access

Article information

Source
Bull. Belg. Math. Soc. Simon Stevin, Volume 3, Number 3 (1996), 301-312.

Dates
First available in Project Euclid: 12 January 2005

Permanent link to this document
https://projecteuclid.org/euclid.bbms/1105554388

Digital Object Identifier
doi:10.36045/bbms/1105554388

Mathematical Reviews number (MathSciNet)
MR1408277

Zentralblatt MATH identifier
0856.03043

Subjects
Primary: 03E70: Nonclassical and second-order set theories
Secondary: 03B25: Decidability of theories and sets of sentences [See also 11U05, 12L05, 20F10]

Keywords
New foundations quantifier complexity

Citation

Kaye, Richard. The quantifier complexity of {${\rm NF}$}. Bull. Belg. Math. Soc. Simon Stevin 3 (1996), no. 3, 301--312. doi:10.36045/bbms/1105554388. https://projecteuclid.org/euclid.bbms/1105554388


Export citation