Jokes aside, I assume they are referring to Gödel's incompleteness theorems, which might well reasonably be characterised in that way.
Jokes aside, I assume they are referring to Gödel's incompleteness theorems, which might well reasonably be characterised in that way.
And if so, would their domains of applicability within the universe of formal systems actually be a classification system of that universe in and of itself?
Some are simple enough to be decidable.
From wikipedia:
> The incompleteness theorems apply to formal systems that are of sufficient complexity to express the basic arithmetic of the natural numbers and which are consistent and effectively axiomatized.
> We partially prove the theorem of [7] that Tarski’s (extremely weak!) plane geometry axioms imply Hilbert’s axioms. https://sciendo.com/article/10.2478/forma-2014-0017
Also, thats for geometric space but I dont see how that's particularly relevant to this. Elsewhere I find that it doesn't contradict Gödel
See https://en.wikipedia.org/wiki/Agda_(programming_language) for a reasonably practical example:
> Agda is a total language, i.e., each program in it must terminate and all possible patterns must be matched.