| Information | |
|---|---|
| has gloss | eng: In mathematical logic, true arithmetic is the theory Th(\mathcalN}) of the natural numbers in the language of first-order Peano arithmetic (Boolos, Burgess, and Jeffrey 2002:295). Tarski's indefinability theorem shows that this theory is not arithmetically definable. |
| lexicalization | eng: true arithmetic |
| instance of | c/Formal theories of arithmetic |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint