Rules can be specified in abbreviated form as P &rarr Q , or more formally: &forall x₁...x_n [ P(s) &rArr Q(succ(s))]

Example:
class(a) = set &and element(a) = x
&rarr class(a) = mapping &and domain(a) = x &and range(a) = boolean

or a:`set of x' &rarr a:`mapping from x to boolean'

Possible implementations of a set:

Operations &isin &cap &cup &forall &exist will be different for each possible implementation.

Contents    Page-10    Prev    Next    Page+10    Index