Back to ComputerTerms

For any BooleanAlgebra we define Boolean terms recursively as follows:

   1. 0 or 1 are turms
   1. Each element of the domain is a term
   1. Each variable is a term
   1. If S and T are terms, then (S or T) and (S and T) are terms.
   1. If S is a term, then S' is a term.

SEE ALSO 
   * BooleanAlgebra

Back to ComputerTerms