Most of our traditional tools for formal modeling, reasoning, and computing are crisp, deterministic, and precise in character. By crisp we mean dichotomous, that is, yes-or-no-type rather than more-or-less type. In conventional dual logic, for instance, a statement can be true or false—and nothing in between. In set theory, an element can either belong to a set or not; and in optimization, a solution is either feasible or not. Precision assumes that the parameters of a model represent exactly either our perception of the phenomenon modeled or the features of the real system that has been modeled. Generally, precision also implies that the model is unequivocal, that is, that it contains no ambiguities.