To understand what Boolean algebra is, you need to understand the concept of algebra and know who George Boole was. About 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), meanwhile, was an outstanding mathematician who is considered one of the pioneers in the development of computer science. His theoretical contributions led to the specialization known as Boolean algebra or Boolean algebra.
Furthermore, this British mathematician and logician is even credited with being the father of what symbolic logical operators are. For this reason, for many specialists, without a doubt, thanks to this, all kinds of logical operations can be performed today, yes thanks to symbolic elements.
Boole proposed a scheme or system for the simplified expression of logical problems through two states (false or true) using a mathematical procedure. This structure is called Boolean algebra.
Through the system devised by Boole, symbols are used for the development of the logical operations “YES”, “NO”, “O” and “Y” (or “YES”, “NOT”, “OR” and “IF” in English), which can thus be outlined. This is one of the pillars of computational arithmetic and electronics.
Also on Digopaul, boolean algebra can be said to appeal to algebraic notions for the treatment of propositional logic statements. The most common operations are binary, which require two arguments. Logical conjunction is called the true result that is obtained when the two statements are true: if A is true and B is true, the conjunction of A and B will be true.
In addition to all the above, we can point out that other operations such as the following are also carried out:
-Null operations, where both contradiction and tautology take center stage. We can establish that they are characterized by the fact that they come to return a value without the need for any arguments.
-Unary operations. These others are those that come to be defined by the fact that they need a single argument to present a result. In addition to this, it must also be emphasized that they can be of two types: denial or identity.
No less important is to know another series of relevant aspects about Boolean algebra, among which we can highlight the following:
-Operations have to be performed 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, you must first resolve what is inside those and then continue to perform the operation “out”.
-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.