The change in size between consecutive "big" heaps (left) is twice that of the change between consecutive "little" heaps (right), yet seems less significant.

The sorites paradox (Template:IPAc-en;[1] sometimes translated as the paradox of the heap because in Template:Lang-grc sōritēs means "heap")[2] is a paradox that arises from vague predicates.[3] A typical formulation involves a heap of sand, from which grains are individually removed. Under the assumption that removing a single grain does not turn a heap into a non-heap, the paradox is to consider what happens when the process is repeated enough times: is a single remaining grain still a heap? (Or are even no grains at all a heap?) If not, when did it change from a heap to a non-heap?[4][5]

## The original formulation and variations

### Paradox of the heap

The word "sorites" derives from the Greek word for heap. The paradox is so named because of its original characterization, attributed to Eubulides of Miletus.[6] The paradox goes as follows: consider a heap of sand from which grains are individually removed. One might construct the argument, using premises, as follows:[5]

Template:Val grains of sand is a heap of sand (Premise 1)
A heap of sand minus one grain is still a heap. (Premise 2)

Repeated applications of Premise 2 (each time starting with one fewer grain) eventually forces one to accept the conclusion that a heap may be composed of just one grain of sand (and consequently, if one grain of sand is still a heap, then removing that one grain of sand to leave no grains at all still leaves a heap of sand; indeed a negative number of grains must also form a heap[7]). Read (1995) observes that "the argument is itself a heap, or sorites, of steps of modus ponens":[8]

Template:Val grains is a heap.
If Template:Val grains is a heap then Template:Val grains is a heap.
So Template:Val grains is a heap.
If Template:Val grains is a heap then Template:Val grains is a heap.
So Template:Val grains is a heap.
If ...
... So Template:Val grain is a heap.

### Variations

Color gradient illustrating a sorites paradox, any adjacent colors being indistinguishable by the human eye

Another formulation is to start with a grain of sand, which is clearly not a heap, and then assume that adding a single grain of sand to something that is not a heap does not turn it into a heap. Inductively, this process can be repeated as much as one wants without ever constructing a heap.[3][5] A more natural formulation of this variant is to assume a set of colored chips exists such that two adjacent chips vary in color too little for human eyesight to be able to distinguish between them. Then by induction on this premise, humans would not be able to distinguish between any colors.[3]

This paradox can be reconstructed for a variety of predicates, for example, with "tall", "rich", "old", "blue", "bald", and so on. Bertrand Russell argued[9] that all of natural language, even logical connectives, is vague; moreover, representations of propositions are vague. However, most views do not go that far, but it is an open question.Template:Fact

Other similar paradoxes are:

## Proposed resolutions

Template:Refimprove section {{ safesubst:#invoke:Unsubst||$N=Original research |date=__DATE__ |$B= {{#invoke:Message box|ambox}} }}

On the face of it, there are some ways to avoid this conclusion. One may object to the first premise by denying Template:Val grains of sand makes a heap. But Template:Val is just an arbitrarily large number, and the argument will go through with any such number. So the response must deny outright that there are such things as heaps. Peter Unger defends this solution.[11] Alternatively, one may object to the second premise by stating that it is not true for all heaps of sand that removing one grain from it still makes a heap. Or one may accept the conclusion by insisting that a heap of sand can be composed of just one grain, and solely deny the further conclusions regarding zero-grain or negative-grain-number heaps.

### Setting a fixed boundary

A common first response to the paradox is to call any set of grains that has more than a certain number of grains in it a heap. If one were to set the "fixed boundary" at, say, Template:Val grains then one would claim that for fewer than Template:Val, it is not a heap; for Template:Val or more, then it is a heap.

However, such solutions are unsatisfactory as there seems little significance to the difference between Template:Val grains and Template:Val grains. The boundary, wherever it may be set, remains as arbitrary and so its precision is misleading. It is objectionable on both philosophical and linguistic grounds: the former on account of its arbitrariness, and the latter on the ground that it is simply not how we use natural language. A more acceptable solution is to call any collection of multiple grains (two or more) a heap, or to call a collection a heap if some grains of sand are supported solely by other grains of sand.

### Unknowable boundaries (or epistemicism)

Timothy Williamson[12][13][14] and Roy Sorensen[15] hold an approach that there are fixed boundaries but that they are necessarily unknowable.

### Supervaluationism

{{#invoke:main|main}} Supervaluationism is a semantics for dealing with irreferential singular terms and vagueness. It allows one to retain the usual tautological laws even when dealing with undefined truth values.[16][17][18][19]

As an example for a proposition about an irreferential singular term, consider the sentence "Pegasus likes licorice". Since the name "Pegasus" fails to refer, no truth value can be assigned to the sentence; there is nothing in the myth that would justify any such assignment. However, there are some statements about "Pegasus" which have definite truth values nevertheless, such as "Pegasus likes licorice or Pegasus doesn't like licorice". This sentence is an instance of the tautology "${\displaystyle p\vee \neg p}$", i.e. the valid schema "${\displaystyle p}$ or not-${\displaystyle p}$". According to supervaluationism, it should be true regardless of whether or not its components have a truth value.

Similarly, "Template:Val grains of sand is a heap of sand" may be considered a border case having no truth value, but "Template:Val grains of sand is a heap of sand, or Template:Val grains of sand is not a heap of sand" should be true.

Precisely, let ${\displaystyle v}$ be a classical valuation defined on every atomic sentence of the language ${\displaystyle L}$, and let ${\displaystyle At(x)}$ be the number of distinct atomic sentences in ${\displaystyle x}$. Then for every sentence ${\displaystyle x}$, at most ${\displaystyle 2^{At(x)}}$ distinct classical valuations can exist. A supervaluation ${\displaystyle V}$ is a function from sentences to truth values such that, a sentence ${\displaystyle x}$ is super-true (i.e. ${\displaystyle V(x)={\text{True}}}$) if and only if ${\displaystyle v(x)={\text{True}}}$ for every classical valuation ${\displaystyle v}$; likewise for super-false. Otherwise, ${\displaystyle V(x)}$ is undefined—i.e. exactly when there are two classical valuations ${\displaystyle v}$ and ${\displaystyle v'}$ such that ${\displaystyle v(x)={\text{True}}}$ and ${\displaystyle v'(x)={\text{False}}}$.

For example, let ${\displaystyle L\;p}$ be the formal translation of "Pegasus likes licorice". Then there are exactly two classical valuations ${\displaystyle v}$ and ${\displaystyle v'}$ on ${\displaystyle L\;p}$, viz. ${\displaystyle v(L\;p)={\text{True}}}$ and ${\displaystyle v'(L\;p)={\text{False}}}$. So ${\displaystyle L\;p}$ is neither super-true nor super-false. However, the tautology ${\displaystyle L\;p\lor \lnot L\;p}$ is evaluated to ${\displaystyle {\text{True}}}$ by every classical valuation; it is hence super-true. Similarly, the formalization of the above heap proposition ${\displaystyle H\;1000}$ is neither super-true nor super-false, but ${\displaystyle H\;1000\lor \lnot H\;1000}$ is super-true.

### Truth gaps, gluts, and many-valued logics

Another approach is to use a multi-valued logic. From this point of view, the problem is with the principle of bivalence: the sand is either a heap or is not a heap, without any shades of gray. Instead of two logical states, heap and not-heap, a three value system can be used, for example heap, indeterminate and not-heap. However, three valued systems do not truly resolve the paradox as there is still a dividing line between heap and indeterminate and also between indeterminate and not-heap. The third truth-value can be understood either as a truth-value gap or as a truth-value glut.[20]

Alternatively, fuzzy logic offers a continuous spectrum of logical states represented in the unit interval of real numbers [0,1]—it is a many-valued logic with infinitely-many truth-values, and thus the sand moves smoothly from "definitely heap" to "definitely not heap", with shades in the intermediate region. Fuzzy hedges are used to divide the continuum into regions corresponding to classes like definitely heap, mostly heap, partly heap, slightly heap, and not heap. [21][22]

### Hysteresis

Another approach is to use hysteresis, that is, knowledge of what the collection of sand started as. Equivalent amounts of sand may be called heaps or not based on how they got there. If a large heap (indisputably described as a heap) is slowly diminished, it preserves its "heap status" to a point, even as the actual amount of sand is reduced to a smaller number of grains. For example, suppose Template:Val grains is a pile and Template:Val grains is a heap. There will be an overlap for these states. So if one is reducing it from a heap to a pile, it is a heap going down until, say, Template:Val. At that point one would stop calling it a heap and start calling it a pile. But if one replaces one grain, it would not instantly turn back into a heap. When going up it would remain a pile until, say, Template:Val grains. The numbers picked are arbitrary; the point is, that the same amount can be either a heap or a pile depending on what it was before the change. A common use of hysteresis would be the thermostat for air conditioning: the AC is set at 77 °F and it then cools down to just below 77 °F, but does not turn on again instantly at 77.001 °F—it waits until almost 78 °F degrees, to prevent instant change of state over and over again.[23]

### Group consensus

One can establish the meaning of the word "heap" by appealing to consensus. This approach claims that a collection of grains is as much a "heap" as the proportion of people in a group who believe it to be so. In other words, the probability that any collection is considered a heap is the expected value of the distribution of the group's views.

A group may decide that:

• One grain of sand on its own is not a heap.
• A large collection of grains of sand is a heap.

Between the two extremes, individual members of the group may disagree with each other over whether any particular collection can be labelled a "heap". The collection can then not be definitively claimed to be a "heap" or "not a heap". This can be considered an appeal to descriptive linguistics rather than prescriptive linguistics, as it resolves the issue of definition based on how the population uses natural language. Indeed, if a precise prescriptive definition of "heap" is available then the group consensus will always be unanimous and the paradox does not arise.Template:Or

Modelling "X more or equally red than Y" as
quasitransitive (Q) and as transitive (T) relation
XY f01000 e02000 d03000 c04000 b05000 a06000
f01000 QT QT QTP QTP QTP QTP
e02000 Q QT QT QTP QTP QTP
d03000 Q QT QT QTP QTP
c04000 Q QT QT QTP
b05000 Q QT QT
a06000 Q QT

### Dropping transitivity of involved relations

In the above color example, the argument is tacitly based on considering the relation "for the human eye, color X is indistinguishable from Y" as an equivalence relation, in particular as transitive. To drop the transitivity assumption is another possibility to resolve the paradox.

Similarly, the paradox is based on considering the relation "for the human eye, color X looks more or equally red than Y" as a reflexive total ordering; dropping its transitivity again resolves the paradox. The latter relation can be described instead as a quasitransitive relation, employing a concept introduced by microeconomist Amartya Sen in 1969.[24] The table shows a simple example, with color differences overdone for readability. A "Q" and a "T" indicates that the row's color looks more or equally red than column's color in the quasitransitive and the transitive version of the relation, respectively. In the quasitransitive version, e.g. the colors f01000 and e02000 are modelled as indistinguishable, since a "Q" appears in both their intersection cells. A "P" indicates the asymmetric part of the quasitransitive version.

To resolve the original heap variation of the paradox with this approach, the relation "X grains are more a heap than Y grains" should be considered quasitransitive rather than transitive.

## In popular culture

Season 1, episode 8 of Fargo is titled "The Heap", after the sorites paradox.[25]

The paradox appeared on Dinosaur Comics on August 28th, 2009.[26] The webcomic SMBC featured a variant of Sorites paradox involving the number of people attending a party on September 27th, 2014 [27]

## References

1. http://www.omnilexica.com/pronunciation/?q=Sorites#.UyL2hPldWSo
2. {{#invoke:citation/CS1|citation |CitationClass=book }}
3. {{#invoke:citation/CS1|citation |CitationClass=book }}
4. {{#invoke:citation/CS1|citation |CitationClass=book }}
5. Template:Cite doi
6. Read, Stephen (1995). Thinking About Logic, p.174. Oxford. ISBN 019289238X.
7. Template:Cite doi Shalizi's 1995 etext is archived at archive.org and at WebCite.
8. {{#invoke:citation/CS1|citation |CitationClass=citation }}
9. {{#invoke:Citation/CS1|citation |CitationClass=journal }} (Alternative: jstor.org)
10. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
11. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
12. {{#invoke:citation/CS1|citation |CitationClass=book }}
13. {{#invoke:citation/CS1|citation |CitationClass=book }}
14. Template:Cite doi
15. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
16. {{#invoke:citation/CS1|citation |CitationClass=book }}
17. Template:Cite doi
18. http://plato.stanford.edu/entries/truth-values/
19. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
20. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
21. Template:Cite doi
22. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
23. Template:Cite news
24. Template:Cite web
25. http://www.smbc-comics.com/?id=3495

## Bibliography

• {{#invoke:citation/CS1|citation

|CitationClass=book }}

• {{#invoke:citation/CS1|citation

|CitationClass=book }}

• {{#invoke:citation/CS1|citation

|CitationClass=book }}

• {{#invoke:citation/CS1|citation

|CitationClass=book }}

• Damir D. Dzhafarov, The sorites paradox: a behavioral approach (with E. N. Dzhafarov), in J. Valsiner and L. Dudolph (eds.).
• {{#invoke:citation/CS1|citation

|CitationClass=book }}

• Kirk Ludwig & Greg Ray, "Vagueness and the Sorites Paradox", Philosophical Perspectives 16, 2002.
• {{#invoke:citation/CS1|citation

|CitationClass=conference }}

• {{#invoke:citation/CS1|citation

|CitationClass=book }}; Sect.3 Template:Refend