| If <math>p\!</math> is the only argument, then <math>\texttt{Mno}(p)</math> says that <math>p\!</math> is false, so <math>\texttt{Mno}(p)</math> expresses the logical negation of the proposition <math>p.\!</math> Wrtten in several different notations, <math>\texttt{Mno}(p) = \texttt{Not}(p) = \lnot p = \tilde{p} = p^\prime.</math> | | If <math>p\!</math> is the only argument, then <math>\texttt{Mno}(p)</math> says that <math>p\!</math> is false, so <math>\texttt{Mno}(p)</math> expresses the logical negation of the proposition <math>p.\!</math> Wrtten in several different notations, <math>\texttt{Mno}(p) = \texttt{Not}(p) = \lnot p = \tilde{p} = p^\prime.</math> |
− | If <math>p\!</math> and <math>q\!</math> are the only two arguments, then <math>\texttt{Mno}(p, q)</math> says that exactly one of <math>p, q\!</math> is false, so <math>\texttt{Mno}(p, q)</math> says the same thing as <math>p \neq q.\!</math> Expressing <math>\texttt{Mno}(p, q)</math> in terms of ands <math>(\cdot),</math> ors <math>(\lor),</math> and nots <math>(\tilde{~})</math> gives the following form: | + | If <math>p\!</math> and <math>q\!</math> are the only two arguments, then <math>\texttt{Mno}(p, q)</math> says that exactly one of <math>p, q\!</math> is false, so <math>\texttt{Mno}(p, q)</math> says the same thing as <math>p \neq q.\!</math> Expressing <math>\texttt{Mno}(p, q)</math> in terms of ands <math>(\cdot),</math> ors <math>(\lor),</math> and nots <math>(\tilde{~})</math> gives the following form. |
| | <math>\texttt{Mno}(p, q) = \tilde{p} \cdot q \lor p \cdot \tilde{q}.</math> | | | <math>\texttt{Mno}(p, q) = \tilde{p} \cdot q \lor p \cdot \tilde{q}.</math> |
| The venn diagram for <math>\texttt{Mno}(p, q, r)</math> is shown in Figure 1. | | The venn diagram for <math>\texttt{Mno}(p, q, r)</math> is shown in Figure 1. |