4 ms·
(total novice question here) Isn't it that because you can approach these mathematical questions from a variety of axiomatic systems?
by Iv 7y ago
(total novice question here) Isn't it that because you can approach these mathematical questions from a variety of axiomatic systems?
- kasmura 7y agoI am not much of an expert either, but as I understand it Zermelo-Frankel set theory is the most common foundation of mathematics and it is stronger than Peano arithmetic so I think Gödel's results hold in general.
- ProfHewitt 7y agoGödel's proof of inferential undecidability (incompleteness) does not work in strongly typed theories because his proposition I'mUnprovable does not exist.