Berry's paradox
The phrases of a language that refer to numbers can be ordered, alphabetically and according to length. There will be a definite set of integers named by those phrases of less than any given length. In particular there will be some integer which is the least integer not nameable in fewer than nineteen syllables. But this phrase ‘the least integer not nameable in fewer than nineteen syllables’ then names this number, yet itself contains fewer than nineteen syllables. Berry's paradox is of the same family as the liar and other semantic paradoxes.

Philosophy dictionary. . 2011.

Look at other dictionaries:

  • Richard's paradox — is a fallacious paradox of mathematical mapping first described by the French mathematician Jules Richard in 1905. Today, it is ordinarily used in order to show the importance of carefully distinguishing between mathematics and metamathematics.… …   Wikipedia

  • König's paradox — Also known as the Zermelo– König paradox. There are non denumerably many real numbers, but only denumerably many of them are finitely definable. Given Zermelo s proof that the reals can be well ordered, the set of reals that are not finitely… …   Philosophy dictionary

  • Berry — s paradox …   Philosophy dictionary

  • Berry paradox — The Berry paradox is a self referential paradox arising from the expression the smallest possible integer not definable by a given number of words. Bertrand Russell, the first to discuss the paradox in print, attributed it to G. G. Berry, a… …   Wikipedia

  • Berry-Paradox — Das Berry Paradoxon (auch: Berry Paradox) ist ein selbstreferenzierendes Paradoxon, das sich aus dem Ausdruck „die kleinste ganze Zahl, die nicht durch eine gegebene Anzahl von Wörtern definierbar ist“ ergibt. Bertrand Russell, der sich als… …   Deutsch Wikipedia

  • Berry-Paradoxon — Das Berry Paradoxon (auch: Berry Paradox) ist ein selbstreferenzierendes Paradoxon, das sich aus dem Ausdruck „die kleinste ganze Zahl, die nicht durch eine gegebene Anzahl von Wörtern definierbar ist“ ergibt. Bertrand Russell, der sich 1908 als… …   Deutsch Wikipedia

  • Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… …   Wikipedia

  • Proof sketch for Gödel's first incompleteness theorem — This article gives a sketch of a proof of Gödel s first incompleteness theorem. This theorem applies to any formal theory that satisfies certain technical hypotheses which are discussed as needed during the sketch. We will assume for the… …   Wikipedia

  • Ontological paradox — An ontological paradox is a paradox of time travel that questions the existence and creation of information and objects that travel in time. It is very closely related to the predestination paradox and usually occurs at the same time. Because of… …   Wikipedia

  • Interesting number paradox — The interesting number paradox is a semi humorous paradox that arises from attempting to classify numbers as interesting or dull . The paradox states that all numbers are interesting. The proof is by contradiction: if there were uninteresting… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”