I think it’s true for any system. And I’d say mathematics or just logic are simple enough. Every system stems from unprovable core assumptions.
Comment on In this essay...
emergencyfood@sh.itjust.works 3 days agoyou cannot prove a system using the system.
Doesn’t that only apply for sufficiently complicated systems? Very simple systems could be provably self-consistent.
bjoern_tantau@swg-empire.de 3 days ago
CompassRed@discuss.tchncs.de 1 day ago
Propositional logic as a system is both complete and consistent.
Shelena@feddit.nl 3 days ago
It applies to systems that are complex enough to formulate the Godel sentence, i.e. “I am unprovable”. Gödel did this using basic arithmetic. So, any system containing basic arithmetic is either incomplete or inconsistent. I believe it is still an open question in what other systems you could express the Gödel sentence.