Kemune

"The more famous incompleteness theorem states that for any self-consistent recursive axiomatic system powerful enough to describe the arithmetic of the natural numbers (for example Peano arithmetic), there are true propositions about the naturals that cannot be proved from the axioms."

Vai valodas gramatika ir konsistenta un pietiekami spēcīga, lai aprakstītu veselo skaitļu aritmētiku? Ja ir, tad saanāk, ka ir teikumi, kas ir patiesi, bet nav gramatiski aprakstāmas (izvedami no aksiomām), un attiecīgi, nav arī computējami.