3 ms·
Very much so.
by VirusNewbie 5y ago
Very much so.
- uoaei 5y agoSo lording esoteric knowledge over the anonymous rabble is more productive than just explaining what is the issue?
- VirusNewbie 5y agook fair enough. There is no issue with proving arithmetic consistency on a finite number of symbols. Incompleteness entirely relies on the unbounded induction step.