If NF is consistent, then yes Con(NF) would be one of these statements. NF can interpret finite order arithmetic, so by that it would be subject to Godel incompleteness theorems. If Randall Holmes's proof of Con(NF) is correct, then NF is slightly stronger than finite order arithmetic, this means that all strong axioms of infinity are independent of it.
Zuhair Al-Johar
- 11.3k
- 1
- 13
- 47