(English) : Boolean algebra
Definition (keystage 4)
Algebra in which we consider a set S and two commutative
operations + and ×, with the rules that:
Note that the operations + and × are not quite the same as for the ordinary numbers.
This kind of algebra is widely used in logic and set theory.
operations + and ×, with the rules that:
- each of the operations has an identity element in S, and these
elements are not the same; - each operation is distributive over the other;
- each element has an inverse in S under each of the operations.
Note that the operations + and × are not quite the same as for the ordinary numbers.
This kind of algebra is widely used in logic and set theory.
Funded by: EU Socrates Minerva, HeyMath!, Cambridge University Press