4 ms·
Doesn't Goedel's incompleteness theorems imply that it is impossible to define all words using words, unless you have some axiomatic words that are not defined
by lutorm 8y ago
Doesn't Goedel's incompleteness theorems imply that it is impossible to define all words using words, unless you have some axiomatic words that are not defined within the system?
- ars 8y agoI don't think it applies here. With words you just end up with circular definitions. With math a circular definition is unacceptable, and that when the theorem comes into play.
- recursive 8y agoIf I understand correctly, axiomatic words are exactly what's being counted here.
- lutorm 8y agoAh, I misread the question. Thanks.
- eximius 8y agoGenerally speaking, the number of words is discrete, not infinite, so I don't believe that Godel's theorems would apply here. I'm not saying that new words aren't created, just that in a practical sense, unless you're creating new words to mess with someone trying to do this, it doesn't apply. You have my most enthusiastic contrafribularities.