3 ms·
Not quite "anything of note" it has to be able to do arithmetic. There are very simple systems that are useful but not powerful enough for Gödel's trick and so
by tialaramex 9y ago
Not quite "anything of note" it has to be able to do arithmetic. There are very simple systems that are useful but not powerful enough for Gödel's trick and so we think those would be safe.
- davrosthedalek 9y agoGeometry, for example.
- Bromskloss 9y agoHow does one write down those axioms?
- roywiggins 9y agoWell there's Euclid's, but the famous modern one is Hilbert's. https://en.m.wikipedia.org/wiki/Hilbert%27s_axioms?wprov=sfla1 https://en.m.wikipedia.org/wiki/Hilbert%27s_axioms?wprov=sfl...
- yorwba 9y agoIf your axioms of Geometry allow statements about the length of line segments, it's probably possible to implement integer arithmetic.
- roywiggins 9y agoEudidean geometry is decidable. https://math.stackexchange.com/questions/90393/why-euclidean-geometry-cannot-be-proved-incomplete-by-gödels-incompleteness-the https://math.stackexchange.com/questions/90393/why-euclidean...