Is there any axiomatized theory of arithmetic that is much stronger to be afflicted by Gödel theorems? I've read that there are axiomatized theories that are weaker than the theorem's criteria, i.e not expressive enough, and their consistency is proved within the same theory. I wondered if there would be something like that, which is stronger than the Gödel theorem's criteria for a axiomatized theory.
Read another response by Peter Smith
Read another response about Mathematics