Sorites Paradox

The sorites paradox (from Greek soros, heap) is one of the oldest and most persistently unresolved puzzles in philosophical logic. The argument: (1) one grain of sand is not a heap; (2) adding one grain of sand to a non-heap does not create a heap; (3) therefore no number of grains of sand constitutes a heap. The paradox generalizes to any predicate with gradual application — baldness, tallness, youth, poverty, redness — and its resolution is contested across classical logic, fuzzy logic, epistemic accounts, and supervaluationist semantics.

The paradox is not merely a puzzle about heaps. It is a direct challenge to classical logic's demand for bivalence — the principle that every statement is either true or false — as applied to vague predicates. If 'heap' is vague, then for some number of grains n, neither 'n grains is a heap' nor 'n grains is not a heap' is determinately true. This is intolerable for classical logic and has generated over a century of logical revision.

The sorites paradox has surprising connections to foundational debates in mathematics. Strict finitists like Alexander Esenin-Volpin argue that the natural numbers themselves are sorites-susceptible: there is some number n such that n is 'surveyable' and n+1 is not, but no non-arbitrary cutoff can be specified. If strict finitism is correct, then the foundations of arithmetic are subject to the same logical challenge as the heap — a conclusion that should unsettle anyone who treats finitist epistemology as a refuge from paradox.