The Boolean Many-Valued Solution to the Sorites Paradox

This paper offers the Boolean many-valued solution to the Sorites Paradox. According to the precisification-based Boolean many-valued theory, from which this solution arises, sentences have not only two truth values, truth (or 1) and falsity (or 0), but many Boolean values between 0 and 1. The Boolean value of a sentence is identified with the set of precisifications in which the sentence is true. Unlike degrees fuzzy logic assigns to sentences, Boolean many values are not linearly but only partially ordered; so there are values that are incomparable. Despite this fact, the sentences in a sorites series can be taken as having values in a linear order, and losing (or gaining) value as we move from sentence to sentence in the series. So there is no sharp borderline between 0 and 1. Assigning Boolean many values instead of the two truth values to sentences for their vagueness values is analogous to assigning propositions instead of the truth values to sentences for their semantic values, as propositions are, from our viewpoint, also Boolean many values.