Definition of

Boolean algebra

Mathematical

George Boole is the father of Boolean algebra.

Boolean algebra is one that appeals to algebraic notions to treat statements of propositional logic. The most common operations are binary , which require two arguments. A logical conjunction is called, in this framework, the true result obtained when the two statements are true: if A is true and B is true, the conjunction of A and B will be true.

To understand what Boolean algebra is, it is necessary to understand the concept of algebra and know who George Boole was. Regarding algebra, we can say that it is the branch of mathematics that appeals to the generalization of arithmetic operations using signs, letters and numbers. These elements are responsible for the representation of mathematical entities through symbolism.

The British George Boole (1815-1864), for his part, was a prominent mathematician who is considered one of the pioneers in the development of computer science. This man is even credited with being the father of symbolic logical operators.

What is Boolean algebra

Boole proposed a scheme or system for the simplified expression of logical problems through two states ( false or true ) through a mathematical procedure. This structure is called Boolean algebra.

Through the system devised by Boole, symbols are used to develop the logical operations “YES” , “NO” , “OR” and “AND” (or “YES” , “NOT” , “OR” and “IF”. in English), which in this way can be schematized. This is one of the pillars of computational arithmetic and electronics .

algebraic notion

Boolean algebra uses algebraic concepts to treat statements of propositional logic.

Other operations

In addition to everything stated above, we can point out that other operations are also carried out:

  • Nullary operations , where both contradiction and tautology take center stage. We can establish that they are characterized by the fact that they return a value without the need for any type of arguments.
  • Unary operations . They need a single argument to present a result and can be of two types: denial or identity.

More interesting facts about Boolean algebra

No less important is knowing another series of relevant aspects about Boolean algebra, among which we can highlight the following:

  • Operations have to be carried out following a hierarchy , since this is the way they can give the correct result. By this we mean that, for example, if there are parentheses, we must first resolve what is inside those symbols and then continue performing the operation “outwards” .
  • In the event that there are several operations with the same hierarchy, whether they are carried out from left to right or from right to left, the result will be identical.