The Berry Paradox turns on the definite description [B] "the least integer not nameable in fewer than 100 sy||ab|es.’ Remark that B is a name (a definite description) with fewer than 100 syllables.? By finiteness considerations, not all integers can be nameable in fewer than 100 syllables; so there exist integers which cannot be nameable in fewer than 100 syllables. By the Well-Ordering Principle, there is a least such. This integer is thus the least integer not nameable in fewer than 100 syllables, and therefore is nameable by B, which has fewer than 100 syllables. This is a contradiction.