The undefinability theorem shows that this encoding cannot be done for semantic concepts such as truth. It shows that no sufficiently rich interpreted language can represent its own semantics. A corollary is that any metalanguage capable of expressing the semantics of some object language must have expressive power exceeding that of the object language. The metalanguage includes primitive notions, axioms, and rules absent from the object language, so that there are theorems provable in the metalanguage not provable in the object language.
— Wikipedia on Tarski’s undefinability theorem
Tarski’s 1969 “Truth and proof” considered both Gödel’s incompleteness theorems and Tarski’s undefinability theorem, and mulled over their consequences for the axiomatic method in mathematics.
— Wikipedia on Alfred Tarski
2019.07.20 Saturday ACHK