In this article I show how to obtain a powerful and truthful explanation of the failure of sorites arguments combining an adaptation of the Wide Set Theory formulated by Formato and Gerla and the concept of deep many valuedness established by Marraud. It is shown that if the premises of a sorites argument are conceived as a succession of indexed consequence operators (where indices express the accuracy of the inferences) prefixing sentences, the argument fails because the transitive property for the inclusion between wide data sets is not always maintained.
@article{urn:eudml:doc:39271,
title = {Wide sets, deep many-valuedness and sorites arguments.},
journal = {Mathware and Soft Computing},
volume = {11},
year = {2004},
pages = {5-11},
zbl = {1061.03057},
mrnumber = {MR2116809},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:39271}
}
Pelta, Carlos. Wide sets, deep many-valuedness and sorites arguments.. Mathware and Soft Computing, Tome 11 (2004) pp. 5-11. http://gdmltest.u-ga.fr/item/urn:eudml:doc:39271/