Privacy Policy
Disclaimer
Copyright
Contact
Sitemap
   
Mathematics
Boolean Algebra
f-alpha.net » Mathematics » Algebra » Boolean Algebra » Let's go... » Experiment 22 - Completeness III

Experiment 22 - Complete representation of Boolean algebra III

1. Complete Representation

In mathematical descriptions of the Boolean Algebra you find mainly the representation with three operations...

  • NOT operation.
  • AND operation.
  • OR operation.

2. Complete Representation

When the design of logical circuits is discussed, you often find the representation with only one operation...

  • NAND operation.

3. Complete Representation

When developing integrated logic circuits you often resort to the NOR operation, because they are particularly simple to implement in integrated circuits...

  • NOR operation.

4. Complete Representation

An additional representation is seen frequently in the literature on digital electronics...

  • NOT operation.
  • AND operation.
  • OR operation.
  • EXCLUSIVE OR (XOR) operation.
  • NAND operation.
  • NOR operation.
  • XNOR operation.

Here two new operations are introduced, the eXclusive OR (XOR) and XNOR operation. You find a description of the operations in the experiments 32 and 33...

But enough about the individual operations and laws. Now you continue with logical problems that can be simplified by using the Boolean algebra...

www.f-alpha.net
Login