Boolean Algebra
Converse Nonimplication in a general Boolean algebra is defined as .
Example of a 2-element Boolean algebra: the 2 elements {0,1} with 0 as zero and 1 as unity element, operators as complement operator, as join operator and as meet operator, build the Boolean algebra of propositional logic.
|
|
and |
|
and |
|
then means |
|
||||||||||||||||||||||||||||||||||||||||||
| (Negation) | (Inclusive Or) | (And) | (Converse Nonimplication) |
Example of a 4-element Boolean algebra: the 4 divisors {1,2,3,6} of 6 with 1 as zero and 6 as unity element, operators (codivisor of 6) as complement operator, (least common multiple) as join operator and (greatest common divisor) as meet operator, build a Boolean algebra.
|
|
and |
|
and |
|
then means |
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| (Codivisor 6) | (Least Common Multiple) | (Greatest Common Divisor) | (x's greatest Divisor coprime with y) |
Read more about this topic: Converse Nonimplication
Famous quotes containing the word algebra:
“Poetry has become the higher algebra of metaphors.”
—José Ortega Y Gasset (1883–1955)