◀ ▲ ▶Branches / Logic / Chapter: Normal Forms in `$PL0$`
Chapter: Normal Forms in $PL0$
We have seen that for each proposition $\phi$ there is a Boolean function $f_\phi$ such that $f_\phi=1$ if and only if $\models \phi$. But do propositions and Boolean functions form a onetoone relationship? The answer to that question is '"no". We will now provide some examples.
Table of Contents
Examples: 1
 Section: Examples of Propositions With Different Syntactic Forms but the Same Boolean Function
 Definition: Canonical Normal Form
 Definition: Literals, Minterms, and Maxterms
 Lemma: Unique Valuation of Minterms and Maxterms
 Definition: Conjunctive and Disjunctive Canonical Normal Forms
 Lemma: Construction of Conjunctive and Disjunctive Canonical Normal Forms
Thank you to the contributors under CC BYSA 4.0!
 Github:

References
Bibliography
 Mendelson Elliott: "Theory and Problems of Boolean Algebra and Switching Circuits", McGrawHill Book Company, 1982
 Hoffmann, Dirk: "Theoretische Informatik, 3. Auflage", Hanser, 2015