Journal of Symbolic Logic

Consistency of strictly impredicative NF and a little more …

Sergei Tupailo

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

An instance of Stratified Comprehension

∀ x1…∀ xn∃ y∀ x (x∈ y ↔ φ(x,x1,…,xn))

is called strictly impredicative iff, under minimal stratification, the type of x is 0. Using the technology of forcing, we prove that the fragment of NF based on strictly impredicative Stratified Comprehension is consistent. A crucial part in this proof, namely showing genericity of a certain symmetric filter, is due to Robert Solovay.

As a bonus, our interpretation also satisfies some instances of Stratified Comprehension which are not strictly impredicative. For example, it verifies existence of Frege natural numbers.

Apparently, this is a new subsystem of NF shown to be consistent. The consistency question for the whole theory NF remains open (since 1937).

Article information

Source
J. Symbolic Logic, Volume 75, Issue 4 (2010), 1326-1338.

Dates
First available in Project Euclid: 4 October 2010

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1286198149

Digital Object Identifier
doi:10.2178/jsl/1286198149

Mathematical Reviews number (MathSciNet)
MR2767971

Zentralblatt MATH identifier
1223.03034

Citation

Tupailo, Sergei. Consistency of strictly impredicative NF and a little more …. J. Symbolic Logic 75 (2010), no. 4, 1326--1338. doi:10.2178/jsl/1286198149. https://projecteuclid.org/euclid.jsl/1286198149


Export citation