What does ZFC do that Peano arithmetic can't do?
What does ZFC do that Peano arithmetic can't do?
More precisely, is there a "natural" statement (a statement that isn't deliberately constructed to be an example) that can be stated in PA, proved in ZFC, but not provable in PA?
6
comments
mo. abbr. please
Plz!
To be fair these abbreviations are ubiquitously used.
Well, Con(PA) is a "natural" statement I'd say, and ZFC proves Con(PA).
What does a Nikon camera have to do with IPv6 private address space?
6
comments