Category: Boolean Algebra

The Logic NOT Function is simply a single input inverter that changes the input of a logic level “1” to an output of logic level “0” and

The Logic OR Function function states that an output action will become TRUE if either one “OR” more events are TRUE, but the order at which they

In 1854, George Boole performed an investigation into the “laws of thought” which were based around a simplified version of the “group” or “set” theory, and from

In the tutorial about the Sum-of-Product (SOP) expression, we saw that it represents a standard Boolean (switching) expression which “Sums” two or more “Products” by taking the

Switching Theory allows us to understand the operation and relationship between Boolean Algebra and two-level logic functions with regards to Digital Logic Gates. Switching theory can

Boolean Algebra is a simple and effective way of representing the switching action of standard logic gates and a set of rules or laws have

As we have seen previously, Boolean Algebra uses a set of laws and rules to define the operation of a digital logic circuit with “0’s”

Boolean Algebra and the Laws of Boolean Algebra can be used to identify unnecessary logic gates within a digital logic design reducing the number of

As well as a standard Boolean Expression, the input and output information of any Logic Gate or circuit can be plotted into a standard table to give

As well as the logic symbols “0” and “1” being used to represent a digital input or output, we can also use them as constants

The NOR or “Not OR” gate is also a combination of two separate logic functions, Not and OR connected together to form a single logic

The NAND or “Not AND” function is a combination of the two separate logical functions, the AND function and the NOT function in series. The