Question: Prove that any Boolean function can be written as a sum of midterms. Draw a truth table with n variables and identify the truth table
Prove that any Boolean function can be written as a sum of midterms. Draw a truth table with n variables and identify the truth table with n-1 variables. Use induction.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
