Back to ComputerTerms
For any BooleanAlgebra we define Boolean terms recursively as follows:
- 0 or 1 are turms
- Each element of the domain is a term
- Each variable is a term
- If S and T are terms, then (S or T) and (S and T) are terms.
- If S is a term, then S' is a term.
SEE ALSO
Back to ComputerTerms