De Morgan’s rules explained
Overview of boolean algebra We have two values: T and F. We can combine these values in three ways: NOT, AND, and OR. NOT NOT is the simplest: NOT T = F NOT F = T We can write this as a truth table: when given.. | results in… ============================ T | F F | … Read more