◀ ▲ ▶Branches / Logic / Lemma: Boolean Algebra of Propositional Logic
We have seen that all Boolean functions can be built
using only the conjunction "$\wedge$", the disjunction "$\vee$",
and the negation "$\neg$" as the only connectives.
This motivates the following lemma:
Lemma: Boolean Algebra of Propositional Logic
The set $B$ of all Boolean terms is a Boolean algebra $(B,\wedge,\vee,1,0)$
with respect to the conjunction "$\wedge$" and the disjunction "$\vee$".
Table of Contents
Proofs: 1
Mentioned in:
Proofs: 1 2 3 4
Thank you to the contributors under CC BYSA 4.0!
 Github:

References
Bibliography
 Knauer Ulrich: "Diskrete Strukturen  kurz gefasst", Spektrum Akademischer Verlag, 2001
 Mendelson Elliott: "Theory and Problems of Boolean Algebra and Switching Circuits", McGrawHill Book Company, 1982