Opening the book…
- 3.1: Boolean Polynomials
- We can proceed more algebraically by assigning value 0 to represent false and value 1 to represent true.
- 3.2: Disjunctive Normal Form
- It is often desired (e.g. in computer programming or logic circuit design) to reverse the process: starting with a desired truth table, can we construct a Boolean polynomial with the same outputs?
This page titled 3: Boolean algebra was last modified on Tue, 01 Sep 2026 03:33:53 GMT and is shared under a GNU Free Documentation License 1.3 license and was authored, remixed, and/or curated by Jeremy Sylvestre via source content that was edited to the style and standards of the LibreTexts platform.
The book could not be loaded just now.