Berry paradox

E73102

The Berry paradox is a self-referential logical paradox arising from phrases like “the smallest positive integer not definable in under eleven words,” which appears to define exactly such a number while claiming it cannot be defined.

AI illustration

How this image was made

AI-generated illustration of Berry paradox

This AI-generated illustration was produced by black-forest-labs/FLUX.2-dev (1024x1024) from a prompt written by openai/gpt-oss-120b from the entity's label + description.

Prompt

Generate an image of the Berry paradox (The Berry paradox is a self-referential logical paradox arising from phrases like “the smallest positive integer not definable in under eleven words,” which appears to define exactly such a number while claiming it cannot be defined.)

All labels observed (2)

Label Occurrences
Berry paradox canonical 3
Berry’s paradox 1

How this entity was disambiguated

Statements (49)

Predicate Object
instanceOf logical paradox ⓘ
philosophical paradox ⓘ
self-referential paradox ⓘ
semantic paradox ⓘ
category paradoxes of definability ⓘ
paradoxes of self-reference ⓘ
concerns finite descriptions of numbers ⓘ
positive integers ⓘ
describedBy the phrase "the smallest positive integer not definable in under eleven words" ⓘ
field foundations of mathematics ⓘ
logic ⓘ
mathematical logic ⓘ
philosophy of mathematics ⓘ
hasAlternativeName Berry’s paradox ⓘ
linked to: Berry paradox
hasKeyFeature arises from quantifying over all definitions expressible in a language ⓘ
can be avoided by formalizing the notion of definition ⓘ
depends on informal notions of definition and word length ⓘ
illustrates limitations of naive talk about definability ⓘ
motivates precise meta-mathematical frameworks ⓘ
shows tension between arithmetic and natural language descriptions ⓘ
uses a phrase that appears to define a number while asserting it is not definable ⓘ
historicalNote based on an observation attributed to G. G. Berry ⓘ
discussed by Bertrand Russell ⓘ
illustrates the need to distinguish object language from meta-language ⓘ
the non-absolute nature of definability ⓘ
influenced development of algorithmic information theory ⓘ
studies of definability in arithmetic ⓘ
involvesConcept arithmetization of language ⓘ
definability ⓘ
description length ⓘ
liar-type construction ⓘ
meta-language ⓘ
natural language ⓘ
self-reference ⓘ
namedAfter G. G. Berry ⓘ
relatedTo Chaitin’s incompleteness theorem ⓘ
Grelling–Nelson paradox ⓘ
Gödel’s incompleteness theorems ⓘ
Kolmogorov complexity ⓘ
Richard paradox ⓘ
Russell’s paradox ⓘ
definability in arithmetic ⓘ
liar paradox ⓘ
semantic paradoxes ⓘ
set-theoretic definability ⓘ
resolutionApproach formalization of the notion of definition ⓘ
use of precise syntactic measures instead of informal word counts ⓘ
usedInArgument arguments about the limits of formal systems ⓘ
arguments for the necessity of a hierarchy of languages ⓘ

How these facts were elicited

Referenced by (4)

Full triples — surface form annotated when it differs from this entity's canonical label.

liar paradox → relatedTo → Berry paradox ⓘ
Berry paradox → hasAlternativeName → Berry’s paradox ⓘ
linked to: Berry paradox
Grelling–Nelson paradox → relatedTo → Berry paradox ⓘ
G. G. Berry → notableFor → Berry paradox ⓘ