Boolean Algebra

← Back to Domain-Specific Abstractions by Domain

2 domain-specific abstractions whose origin domain is Boolean Algebra.

• Inclusion (Boolean algebra) — The canonical partial order on a Boolean algebra, where a≤b exactly when a∧¬b=0, equivalently a∧b=a or a∨b=b.
• Product term — A Boolean expression formed as the conjunction of one or more literals, with a minterm as the special case containing every variable exactly once.