Abstract

Noniterative approaches to the sorites paradox accept single steps of soritical reasoning, but deny that these can be combined into valid chains of soritical reasoning. The distributed sorites is a puzzle designed to undermine noniterative approaches to the sorites paradox, by deriving an inconsistent conclusion using only single steps, but not chains, of soritical reasoning. This paper shows how a dialetheist version of the noniterative approach, the strict-tolerant approach, also solves the distributed sorites paradox, at no further cost, by accepting the inconsistent conclusion.