Boolean Algebra 1 – The Laws of Boolean Algebra

This computer science video is about the laws of Boolean algebra. It briefly considers why these laws are needed, that is to simplify complex Boolean expressions, and then demonstrates how the laws can be derived by examining simple logic circuits and their truth tables. It also shows how some of these laws relate to familiar properties of base 10 numbers, namely the associative, commutative and distributive properties. In addition, this video covers De Morgan’s theorem. It illustrates how De Morgan’s theorem can be proved by comparing the behaviours of the relevant logic circuits. The video that follows on from this one describes how the laws of Boolean algebra can be applied to simplify complex Boolean expressions.

• #
• #logic_gates
• #and
• #or
• #not
• #truth_table
• #boolean_algebra
• #annulment
• #laws
• #identity
• #idempotent
• #complement
• #double_negation
• #associative
• #commutative
• #distributive
• #de_morgans_theorem
• #computer_science
• #electronics
• #a_level