Difference between revisions of "Minimal negation operator"
Jon Awbrey (talk | contribs) (→Glossary of basic terms: format as definition list) |
Jon Awbrey (talk | contribs) |
||
Line 189: | Line 189: | ||
: This means that the set of objects <math>\{ x_j : 1 \le j \le k \}</math> is a set of boolean functions <math>\{ x_j : \mathbb{B}^k \to \mathbb{B} \}</math> subject to logical interpretation as a set of ''basic propositions'' that collectively generate the complete set of <math>2^{2^k}</math> propositions over <math>\mathbb{B}^k.</math> | : This means that the set of objects <math>\{ x_j : 1 \le j \le k \}</math> is a set of boolean functions <math>\{ x_j : \mathbb{B}^k \to \mathbb{B} \}</math> subject to logical interpretation as a set of ''basic propositions'' that collectively generate the complete set of <math>2^{2^k}</math> propositions over <math>\mathbb{B}^k.</math> | ||
− | + | ; Literal | |
+ | : A ''literal'' is one of the <math>2k\!</math> propositions <math>x_1, \ldots, x_k, (x_1), \ldots, (x_k),</math> in other words, either a ''posited'' basic proposition <math>x_j\!</math> or a ''negated'' basic proposition <math>(x_j),\!</math> for some <math>j = 1 ~\text{to}~ k.</math> | ||
* In mathematics generally, the '''[[fiber (mathematics)|fiber]]''' of a point ''y'' under a function ''f'' : ''X'' → ''Y'' is defined as the inverse image <math>f^{-1}(y)</math>. | * In mathematics generally, the '''[[fiber (mathematics)|fiber]]''' of a point ''y'' under a function ''f'' : ''X'' → ''Y'' is defined as the inverse image <math>f^{-1}(y)</math>. |
Revision as of 02:01, 21 May 2009
In logic and mathematics, the minimal negation operator \(\nu\!\) is a multigrade operator \((\nu_k)_{k \in \mathbb{N}}\) where each \(\nu_k\!\) is a \(k\!\)-ary boolean function defined in such a way that \(\nu_k (x_1, \ldots , x_k) = 1\) if and only if exactly one of the arguments \(x_j\!\) is \(0.\!\)
In contexts where the initial letter \(\nu\!\) is understood, the minimal negation operators can be indicated by argument lists in parentheses. The first four members of this family of operators are shown below, with paraphrases in a couple of other notations, where tildes and primes, respectively, indicate logical negation.
\(\begin{matrix} (~) & = & 0 & = & \operatorname{false} \'"`UNIQ-MathJax1-QINU`"' * The point \((0, 0, \ldots , 0, 0)\) with all 0's as coordinates is the point where the conjunction of all negated variables evaluates to \(1,\!\) namely, the point where:
To pass from these limiting examples to the general case, observe that a singular proposition \(s : \mathbb{B}^k \to \mathbb{B}\) can be given canonical expression as a conjunction of literals, \(s = e_1 e_2 \ldots e_{k-1} e_k\). Then the proposition \(\nu (e_1, e_2, \ldots, e_{k-1}, e_k)\) is \(1\!\) on the points adjacent to the point where \(s\!\) is \(1,\!\) and 0 everywhere else on the cube. For example, consider the case where \(k = 3.\!\) Then the minimal negation operation \(\nu (p, q, r)\!\), when there is no risk of confusion written more simply as \((p, q, r)\!\), has the following venn diagram:
For a contrasting example, the boolean function expressed by the form \(((p),(q),(r))\!\) has the following venn diagram:
Glossary of basic terms
See alsoTemplate:Col-break
External linksAficionados
<sharethis /> |