Skip to main content
1 of 6
Joel David Hamkins
  • 236.5k
  • 44
  • 777
  • 1.4k

NBG does not prove the second-order $\in$-recursion scheme.

To see this, take an $\omega$-nonstandard model of NBG, with only the parametrically definable classes. For each standard $n$, there is a class $\Sigma_n$ truth predicate. But there is no definable truth predicate for nonstandard $\Sigma_n$ truth, by the usual proof of Tarski's theorem.

So there can be no least $n$ for which there is a $\Sigma_n$-truth predicate, and this violates second-order $\in$-recursion.

We can turn this argument into a proof that the second-order $\in$-recursion scheme implies that there is a truth predicate for first-order truth. There is such a predicate for $\Sigma_0$ truth, and from any such $\Sigma_n$ truth predicate we can define a $\Sigma_{n+1}$-truth predicate. These are unique when they exist and cohere into a full truth predicate for first-order truth.

This implies $\text{Con}(\text{ZFC})$ and much more.

Joel David Hamkins
  • 236.5k
  • 44
  • 777
  • 1.4k