◀ ▲ ▶Branches / Logic / Corollary: All Boolean Functions Can Be Built Using Conjunction, Disjunction, and Negation
Corollary: All Boolean Functions Can Be Built Using Conjunction, Disjunction, and Negation
(related to Lemma: Construction of Conjunctive and Disjunctive Canonical Normal Forms)
Every Boolean function can be represented by Boolean variables or constants connected by the conjunction "$\wedge$", the disjunction "
$\vee$", and the negation "$\neg$" as the only connectives.
Table of Contents
Thank you to the contributors under CC BY-SA 4.0!
- Mendelson Elliott: "Theory and Problems of Boolean Algebra and Switching Circuits", McGraw-Hill Book Company, 1982
- Hoffmann, Dirk: "Theoretische Informatik, 3. Auflage", Hanser, 2015