Example of completeness

• Show that { NOR } is complete.

• Solution:

  • Implement NOT:
    • A’ = (A+A)’ = A nor A
  • Implement AND:
    • AB = (A’ + B’)’ = (A nor A) nor (B nor B)
  • Implement OR:
    • A + B = ((A + B)’)’ = (A nor B) nor (A nor B)

Previous slide

Next slide

Back to first slide

View graphic version