The two theorems suggested by De-Morgan which are extremely useful in Boolean Algebra are as following.
- The left hand side (LHS) of this theorem represents a NAND gate with input A and B where the right hand side (RHS) of the theorem represents an OR gate with inverted inputs.
- This OR gate is called as Bubbled OR.
Table showing verification of the De-Morgans’s first theorem
- The LHS of this theorem represented a NOR gate with input A and B whereas the RHS represented an AND gate with inverted inputs.
- This AND gate is called as Bubbled AND.
Table showing verification of the De-Morgans’s second theorem