|
Lecture 2022-02-15. A proof by strong induction: the Fundamental Theorem of Arithmetic. Induction on a definition: boolean formulas have the same number of left and right parentheses. Recursion as a…
|
|
|
|
Review (particularly of functional completeness). More boolean operators: IMPLIES, IFF, XOR, NAND, NOR. Gates and circuits. A formal treatment of boolean formulas: syntax, truth assignments, and…
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|