Differences between revisions 1 and 2
⇤ ← Revision 1 as of 2003-11-04 00:28:22 →
Size: 308
Editor: wakko
Comment:
← Revision 2 as of 2003-11-04 00:50:29 → ⇥
Size: 367
Editor: yakko
Comment:
Deletions are marked like this. Additions are marked like this.
Line 10: Line 10:

SEE ALSO
   * BooleanAlgebra

Back to ComputerTerms

Back to ComputerTerms

For any BooleanAlgebra we define Boolean terms recursively as follows:

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

SEE ALSO

Back to ComputerTerms

BooleanTerm (last edited 2003-11-04 00:50:29 by yakko)