BOOLEAN ALGEBRA

Contenido
OBJECTIVES........................................................................................................................................2
HISTORY.............................................................................................................................................2
WHAT IS BOOLEAN ALGEBRA?...........................................................................................................3
APPLICATIONS....................................................................................................................................3
RULE IN BOOLEAN ALGEBRA..............................................................................................................3
Boolean Laws.................................................................................................................................4
EXAMPLES..........................................................................................................................................5
CONCLUSIONS....................................................................................................................................6
CYBER.................................................................................................................................................6

OBJECTIVES
 Know and recognize all about Boolean algebra for the application.
  Meet the Boolean´s rules.
 Make examples about exercises with Boolean Algebra.

HISTORY
Boole's algebra predated the modern developments in abstract algebra and mathematical logic; it
is however seen as connected to the origins of both fields. In an abstract setting, Boolean algebra
was perfected in the late 19th century by Jevons, Schröder, Huntington, and others until it reached
the modern conception of an (abstract) mathematical structure. For example, the empirical
observation that one can manipulate expressions in the algebra of sets by translating them into
expressions in Boole's algebra is explained in modern terms by saying that the algebra of sets is a
Boolean algebra (note the indefinite article). In fact, M. H. Stone proved in 1936 that every
Boolean algebra is isomorphic to a field of sets.

In the 1930s, while studying switching circuits, Claude Shannon observed that one could also apply
the rules of Boole's algebra in this setting, and he introduced switching algebra as a way to analyze
and design circuits by algebraic means in terms of logic gates. Shannon already had at his disposal
the abstract mathematical apparatus, thus he cast his switching algebra as the two-element
Boolean algebra. In circuit engineering settings today, there is little need to consider other Boolean
algebras, thus "switching algebra" and "Boolean algebra" are often used interchangeably. Efficient
implementation of Boolean functions is a fundamental problem in the design of combinational
logic circuits. Modern electronic design automation tools for VLSI circuits often rely on an efficient
representation of Boolean functions known as (reduced ordered) binary decision diagrams (BDD)
for logic synthesis and formal verification.

WHAT IS BOOLEAN ALGEBRA?

Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It uses only the binary
numbers i.e. 0 and 1. It is also called as Binary Algebra or logical Algebra.

APPLICATIONS
All operations carried out in a digital system use the laws of boole, are implemented by software
or hardware since it is this that defines the arithmetic laws as addition and multiplication.

It is of great importance in the computer science and in the electronic one since it serves to
simplify electronic circuits of fast and economic way.
RULE IN BOOLEAN ALGEBRA
Following are the important rules used in Boolean algebra.

 Variable used can have only two values. Binary 1 for HIGH and Binary 0 for LOW.
 Complement of a variable is represented by an overbar (-). Thus, complement of variable B
is represented as B Bar. Thus if B = 0 then B Bar = 1 and B = 1 then B Bar = 0.
 ORing of the variables is represented by a plus (+) sign between them. For example ORing
of A, B, C is represented as A + B + C.
 Logical ANDing of the two or more variable is represented by writing a dot between them
such as A.B.C. Sometime the dot may be omitted like ABC.

Boolean Laws
There are six types of Boolean Laws.

 Commutative law: Any binary operation which satisfies the following expression is
referred to as commutative operation.

Commutative Law Commutative law states that changing the sequence of the variables
does not have any effect on the output of a logic circuit.
 Associative law: This law states that the order in which the logic operations are performed
is irrelevant as their effect is the same.

 Distributive law: Distributive law states the following condition.

  AND law: These laws use the AND operation. Therefore they are called as AND laws.

 OR law: These laws use the OR operation. Therefore they are called as OR laws.

 INVERSION law: This law uses the NOT operation. The inversion law states that double
inversion of a variable results in the original variable itself.

EXAMPLES
Boolean Algebra Example No1
Construct a Truth Table for the logical functions at points C, D and Q in the following
circuit and identify a single logic gate that can be used to replace the whole circuit.

First observations tell us that the circuit consists of a 2-input NAND gate, a 2-input EX-OR gate and
finally a 2-input EX-NOR gate at the output. As there are only 2 inputs to the circuit labelled A and
B, there can only be 4 possible combinations of the input ( 22 ) and these are: 0-0, 0-1, 1-0 and
finally 1-1. Plotting the logical functions from each gate in tabular form will give us the following
truth table for the whole of the logic circuit below.

From the truth table above, column C represents the output function generated by the NAND
gate, while column D represents the output function from the Ex-OR gate. Both of these two
output expressions then become the input condition for the Ex-NOR gate at the output.

It can be seen from the truth table that an output at Q is present when any of the two inputs A or
B are at logic 1. The only truth table that satisfies this condition is that of an OR Gate. Therefore,
the whole of the above circuit can be replaced by just one single 2-input OR Gate.
CONCLUSIONS
 Thanks to this work we can learnt about Boolean Algebra.
 We can know about the Fields of application of Boolean Algebra.
 We learnt how are the exercises using Boolean Algebra.

CYBER
- https://prezi.com/6cjjb7sjyt3j/aplicaciones-en-el-mundo-real-del-algebra-de-boole/
- https://www.electronics-tutorials.ws/boolean/bool_8.html
- https://www.tutorialspoint.com/computer_logical_organization/boolean_algebra.htm
- https://en.wikipedia.org/wiki/Boolean_algebra#History