Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
NDICE
PALABRAS CLAVE
RESUMEN
CPTULO I: TEOREMAS Y PROPIEDADES DEL ALGEBRA DE BOOLE
CPTULO II: FUNCIONES BOOLEANAS
2.1. Representacin de funciones lgicas.
2.2. Formas cannica y normalizada
CPTULO III: SIMPLIFICACION DE FUNCIONES BOOLEANAS
3.1. Mtodo del mapa de Karnaugh
CPTULO IV: COMPUERTAS LOGICAS
CPTULO V: PROBLEMAS RESUELTOS
DISCUSIN
CONCLUSIONES
PALABRAS CLAVES
RESUMEN
ABSTRACT
This work is based on the book Linear Algebra Author Fernando Hitt ,
besides the calculation Digital Morris 's book , has tried to make a concise
summary of the work done in these books .
We thought desirable to give feedback that will help them understand the
issues , also developed proposed problems , several books of digital
computation.
We hope that the work is very helpful to our readers and will take
advantage.
DEDICATORIA
A (A + B) = A B
TEOREMA 8 (ASOCIATIVIDAD): cada uno de los operadores binarios (+) y()
cumple la propiedad asociativa:
A+(B+C) = (A+B)+C
2.2. Formas
X Y Z
Termino
A
B
C
0
0
0
0
0
0
0
0
1
0
0
1
0
1
0
0
1
0
0
1
1
0
1
1
1
0
0
1
0
0
Designacin
1
0
1
1
0
1
1
1
0
1
1
0
1
1
1
1
1
1
D F
0
0
1
0
0
0
1
0
0
0
1
0
0
1
1
1
cannica y normalizada
0
0
1Termino
1
Designacin
0
0
1
0
0
0
1
0
0
0
1
0
X Y Z
m0
X +Y + Z
M0
X Y Z
m1
X +Y + Z
M1
X Y Z
m2
X + Y + Z
M2
X YZ
m3
X + Y + Z
M3
X Y Z
m4
X +Y + Z
M4
X Y Z
m5
X +Y + Z
M5
XY Z
m6
X + Y + Z
M6
XYZ
m7
X + Y + Z
M7
X
0
0
0
0
1
1
1
1
Y
0
0
1
1
0
0
1
1
Z
0
1
0
1
0
1
0
1
F1
0
1
0
0
0
1
0
1
F2
0
0
1
0
1
0
1
0
Y Z+ X Y Z+ XYZ
F 1= X
Y Z+
X Y Z+
XY Z
F 2= X
Compuertas
AND
NAND
NOR
OR
NOR
XOR
INVERSOR
INVERS
OR
ESQUEMA
ESQUEMA DIGITAL
DISCUCION
DISCUSSION
The work was synthesized in the presentation of the properties and theorems of
Boolean algebra and its application to the solution of conditional exercises.
These properties were argued briefly to the correct understanding of readers.
Finally the text intended to solving selected exercises can help guide the
decision of others.
CONCLUSIONES
CONCLUSIONS
Boolean algebra is the basis of all digital electronics. Today means that from a
clock, so internet would not work without this mathematical genius.
Boolean algebra are algebraic rules based on set theory , to handle equations
of mathematical logic.
Since Boolean algebra is an issue that can be applied in complex areas as may
be programming, this assay was done as an easy and accurate method for
those who need information to guide the basics of this subject in the area
required