BOOLEAN ALGEBRA
Charles François (2004). BOOLEAN ALGEBRA, International Encyclopedia of Systems and Cybernetics, 2(1): 315.
| Collection | International Encyclopedia of Systems and Cybernetics |
|---|---|
| Year | 2004 |
| Vol. (num.) | 2(1) |
| ID | ◀ 315 ▶ |
| Object type | Methodology or model |
The algebra corresponding to discrete (or finite) mathematics.
This algebra was introduced by the British mathematician and logician G. BOOLE in his book “An Investigation in the Laws of Thought” (1854)
J. WARFIELD resumes: “There are precisely two constants in Boolean algebra. They are 0 and 1. A Boolean variable x is an unknown that may take only the values of the constants, that is 0 or 1.
- “The complement of O is 1, and the complement of 1 is 0. The complement of a Boolean variable x is written - x. It is also called the ”negation of x“ or may be read simply as ”not x“ (1989, p.208).
The parts of Boolean algebra which are relevant for systemics are “… sets and partitions, orders and partial orders, binary relations and lattices…, vectors, matrices and digraphs” (Ibid)
WARFIELD develops these aspects and gives references (p.208-84). He developed his theory in notably systemic terms.