Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T00:58:22.329Z Has data issue: false hasContentIssue false

The consistency problem for NF

Published online by Cambridge University Press:  12 March 2014

M. Boffa*
Affiliation:
Université de L'etat à Mons, Université Libre de Bruxelles, Belgique

Extract

Although this problem is still open, there are a few related results concerning (i) theories equiconsistent with NF and (ii) consistent fragments of NF. Concerning (i) we will discuss the following results

(1) Specker's result about the equiconsistency of NF with an extension of the theory of types [16],

(2) the equiconsistency of NF with fragments of NF containing NFU [2], [10],

and a new one about

(3) the equiconsistency of NF with an extension of Zermelo's set theory with the axiom of comprehension restricted to bounded formulas.

Concerning (ii) we will give a simplified proof and a generalization of (4) Jensen's result about the consistency of NFU [13].

Only a few words will be devoted to

(5) Grishin's results and refinements [4], [5], [8], [9], treated with more details in [4].

The reader who is unfamiliar with NF or who has a natural repulsion for this system is first invited to read the excellent account contained in [7, Chapter III, §3].

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1977

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable