In many applications, it has been useful to reformulate the problem in purely algebraic terms, i.e., in terms of axioms that the basic operations must satisfy: there are useful applications of groups, rings, fields, etc. From this viewpoint, it is desirable to be able to describe the class of uncertainty-related sets with the corresponding arithmetic operations in algebraic terms. In this paper, we provide such a representation.

Our representation has the same complexity complexity as the usual algebraic description of a field (such as the field of real numbers).

]]>In this paper, we show that the computer way is faster. This adds one more example to the list of cases when computer-based arithmetic algorithms are much more efficient than the algorithms that we humans normally use.

]]>Specifically, we suggest that the overall grade be -- as now -- the weighted average of the grades corresponding to different parts of the material, but each of these parts-grades is now calculated differently: instead of the weighted average of grades corresponding to different assignments in which this material is tested, we suggest using the *largest* of the grades corresponding to all these assignments.