Bertrand Russell, the first to discuss the paradox in print, attributed it to G. G. Berry (1867–1928),[1] a junior librarian at Oxford's Bodleian Library.
Mathematician and computer scientist Gregory Chaitin in The Unknowable (1999) adds this comment: "Well, the Mexican mathematical historian Alejandro Garcidiego has taken the trouble to find that letter [of Berry's from which Russell penned his remarks], and it is rather a different paradox.
Other terms with this type of ambiguity are: satisfiable, true, false, function, property, class, relation, cardinal, and ordinal.
Terms with systematic ambiguity may be written with subscripts denoting that one level of meaning is considered a higher priority than another in their interpretation.
[5] However, one can read Alfred Tarski's contributions to the Liar Paradox to find how this resolution in languages falls short.
[6][7] Saul Kripke is credited with identifying this incompleteness in Tarski's hierarchy in his highly cited paper "Outline of a theory of truth,"[7] and it is recognized as a general problem in hierarchical languages.
[8][7] Using programs or proofs of bounded lengths, it is possible to construct an analogue of the Berry expression in a formal mathematical language, as has been done by Gregory Chaitin.
[10] It is not possible in general to unambiguously define what is the minimal number of symbols required to describe a given string (given a specific description mechanism).
The Kolmogorov complexity is defined using formal languages, or Turing machines which avoids ambiguities about which string results from a given description.