{"id":4485,"date":"2021-06-06T10:06:24","date_gmt":"2021-06-06T10:06:24","guid":{"rendered":"https:\/\/enorcerna.com\/wiki\/definition\/boolean-algebra\/"},"modified":"2021-06-06T10:06:24","modified_gmt":"2021-06-06T10:06:24","slug":"boolean-algebra","status":"publish","type":"post","link":"https:\/\/enorcerna.com\/wiki\/definition\/boolean-algebra\/","title":{"rendered":"boolean algebra"},"content":{"rendered":"
\n

To understand what the boolean algebra<\/strong> it is necessary to understand the concept of algebra<\/strong> and know who it was George Boole<\/strong>. About algebra, we can say that it is the branch of the math<\/strong> 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.<\/p>\n

\"BooleanThe British George Boole<\/strong> (1815-1864), for his part, was an outstanding mathematician who is considered one of the pioneers in the development of the science of computing<\/strong>. His theoretical contributions gave rise to the specialization known as Boolean algebra<\/strong> or boolean algebra<\/strong>.<\/p>\n

What's more, this British mathematician and logician is even credited with being the father of symbolic logical operators. Therefore, for many specialists, without a doubt, thanks to this today all kinds of logical operations can be carried out, yes thanks to symbolic elements. <\/p>\n

Boole<\/strong> proposed a scheme or system<\/strong> for the simplified expression of logic problems<\/strong> through two statesfake<\/strong> or true<\/strong>) using a mathematical procedure. This structure is called Boolean algebra.<\/p>\n

Through the system devised by Boole, symbols are used for the development of logical operations \"YES\"<\/em>, \"NOT\"<\/em>, \"OR\"<\/em> and \"Y\"<\/em> (or \"AND IT IS\"<\/em>, \"NOT\"<\/em>, \"OR\"<\/em> and \"IF\"<\/em> in English), which can thus be schematized. This is one of the pillars of computational arithmetic and electronics<\/strong>.<\/p>\n

It can be said that Boolean algebra appeals to algebraic notions for the treatment of sentences of propositional logic. The operations<\/strong> most common are binary<\/strong>, which require two arguments. Is named logical conjunction<\/strong> to the true result that is obtained when the two statements are true: if TO<\/strong> it's true and B<\/strong> is true, the conjunction of TO<\/strong> Y B<\/strong> will be true.<\/p>\n

In addition to all the above, we can point out that other operations are also carried out such as the following:
-Null 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. 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. <\/p>\n

No less important is knowing another series of relevant aspects about Boolean algebra, among which we can highlight the following:
-The operations have to be carried out following a hierarchy, since it is the way that they can give the correct result. By this we mean that, for example, if there are parentheses, first what is inside them must be resolved and then continue to carry out the operation \u201coutside\u201d.
-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.<\/p>\n<\/p><\/div>\n\n\n

\n \n
\n \n
\n
\n \n\n
<\/div>\n <\/div>\n
\n \n\n
<\/div>\n <\/div>\n
\n \n\n
<\/div>\n <\/div>\n
\n \n\n
<\/div>\n <\/div>\n
\n \n\n
<\/div>\n <\/div>\n <\/div>\n \n
\n
\n \n\n
<\/div>\n <\/div>\n
\n \n\n
<\/div>\n <\/div>\n
\n \n\n
<\/div>\n <\/div>\n
\n \n\n
<\/div>\n <\/div>\n
\n \n\n
<\/div>\n <\/div>\n <\/div>\n<\/div>\n \n\n
\n Rate this post<\/span>\n <\/div>\n <\/div>\n","protected":false},"excerpt":{"rendered":"

To understand what the boolean algebra it is necessary to understand the…<\/p>\n","protected":false},"author":1,"featured_media":4486,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[],"class_list":["post-4485","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-definition"],"_links":{"self":[{"href":"https:\/\/enorcerna.com\/wiki\/wp-json\/wp\/v2\/posts\/4485","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/enorcerna.com\/wiki\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/enorcerna.com\/wiki\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/enorcerna.com\/wiki\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/enorcerna.com\/wiki\/wp-json\/wp\/v2\/comments?post=4485"}],"version-history":[{"count":0,"href":"https:\/\/enorcerna.com\/wiki\/wp-json\/wp\/v2\/posts\/4485\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/enorcerna.com\/wiki\/wp-json\/wp\/v2\/media\/4486"}],"wp:attachment":[{"href":"https:\/\/enorcerna.com\/wiki\/wp-json\/wp\/v2\/media?parent=4485"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/enorcerna.com\/wiki\/wp-json\/wp\/v2\/categories?post=4485"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/enorcerna.com\/wiki\/wp-json\/wp\/v2\/tags?post=4485"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}