Documentos de Académico
Documentos de Profesional
Documentos de Cultura
Su álgebra consiste en un
método para resolver
problemas de lógica que
recurre solamente a los
valores binarios 1 y 0 y a
tres operadores:
AND (y)
George Boole OR (o)
1815-1864
NOT (no)
010101010100101010101010101010010101010110010101
Las variables Booleanas
010101010100101010101010101010010101010110010101
sólo toman los valores
010101010100101010101010101010010101010110010101
binarios: 1 ó 0.
010101010100101010101010101010010101010110010101
010101010100101010101010101010010101010110010101
Una variable Booleana
010101010100101010101010101010010101010110010101
010101010100101010101010101010010101010110010101
representa un bit que
010101010100101010101010101010010101010110010101
quiere decir:
010101010100101010101010101010010101010110010101
010101010100101010101010101010010101010110010101
010101010100101010101010101010010101010110010101
Binary digIT
010101010100101010101010101010010101010110010101
OPERACIONES LÓGICAS EXPRESIONES BOLEANAS
X=A ˅ B X =A+ B
X= A˄ B X=A*B
X = X' X = X'
X = (A ˄ B) ' X = (A * B) '
X = (A ˅ B) ' X =( A + B) '
X = A'B +AB'
X= A→ B
X= A B X = AB +A'B'
TEOREMAS Y LEYES
BOOLEANOS
Reglas del algebra de Boole que se utilizan para simplificar las expresiones
booleanas
NAND y negativa-OR
NOR y negativa-AND
1. (X + Y)’ = X’ . Y’
2. (X . Y)’ = X’ + Y’
Inputs Output
A B AB A + B
0 0 1 1
0 1 1 1
1 0 1 1
1 1 0 0
Inputs Output
A B A + B AB
0 0 1 1
0 1 0 0
1 0 0 0
1 1 0 0
VCC VCC VCC VCC
14 13 12 11 10 9 8 14 13 12 11 10 9 8 14 13 12 11 10 9 8 14 13 12 11 10 9 8
1 2 3 4 5 6 7 1 2 3 4 5 6 7 1 2 3 4 5 6 7 1 2 3 4 5 6 7
GND GND GND GND
'00 ' 02 '04 '08
1 2 3 4 5 6 7 1 2 3 4 5 6 7 1 2 3 4 5 6 7 1 2 3 4 5 6 7
GND GND GND GND
'10 '11 '20 '21
1 2 3 4 5 6 7 1 2 3 4 5 6 7 1 2 3 4 5 6 7 1 2 3 4 5 6 7
GND GND GND GND
'27 '30 '32 '86