“…A "crisp kernel of antonymy" of P can be reached, once an antonym aP is known, through the set A P = {x ∈ X : p(x) ≤ p a (x)}, containing those elements of X showing "P less than aP " [10], those that are more covered by aP than by P . For instance, provided X is an interval Provided P is precise, it is A P = {x ∈ X : 1 = p a (x)}, that, if p a is not coincidental with p (P is regular), cannot be coincidental with the crisp complement of the crisp set specified by P in X.…”