Definition:Minimal Negation Operator

The minimal negation operator $\nu\!$ is a multigrade operator $(\nu_k)_{k \in \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$ in just those cases where 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. In the following text, a distinctive typeface will be used for logical expressions based on minimal negation operators, for example, $\mathsf{(x, y, z)}$ = $\nu (x, y, z).\!$

The first four members of this family of operators are shown below, with paraphrases in three other notations, where tildes and primes indicate logical negation.

To express the general case of $\nu_k\!$ in terms of familiar operations, it helps to introduce an intermediary concept:

Definition. Let the function $\lnot_j : \mathbb B^k \to \mathbb B$ be defined for each integer $j\!$ in the interval $[1, k]\!$ by the following equation:

Then $\nu_k : \mathbb B^k \to \mathbb B$ is defined by the following equation:

If we think of the point $x = (x_1, \ldots, x_k) \in \mathbb B^k$ as indicated by the boolean product $x_1 \cdot \ldots \cdot x_k$ or the logical conjunction $x_1 \land \ldots \land x_k,$ then the minimal negation $\mathsf{(} x_1, \ldots, x_k \mathsf{)}$ indicates the set of points in $\mathbb B^k$ that differ from $x\!$ in exactly one coordinate. This makes $\mathsf{(} x_1, \ldots, x_k \mathsf{)}$ a discrete functional analogue of a point omitted neighborhood in analysis, more exactly, a point omitted distance one neighborhood. In this light, the minimal negation operator can be recognized as a differential construction, an observation that opens a very wide field. It also serves to explain a variety of other names for the same concept, for example, logical boundary operator.

The remainder of this discussion proceeds on the algebraic boolean convention that the plus sign $(+)\!$ and the summation symbol $(\textstyle\sum)$ both refer to addition modulo 2. Unless otherwise noted, the boolean domain $\mathbb B = \{ 0, 1 \}$ is interpreted so that $0 = \operatorname{false}$ and $1 = \operatorname{true}.$ This has the following consequences:

The following properties of the minimal negation operators $\nu_k : \mathbb B^k \to \mathbb B$ may be noted:

Truth tables
Table 1 is a truth table for the sixteen boolean functions of type $f : \mathbb B^3 \to \mathbb B$ whose fibers of 1 are either the boundaries of points in $\mathbb B^3$ or the complements of those boundaries.

Charts and graphs
This Section focuses on visual representations of minimal negation operators. A few bits of terminology are useful in describing the pictures, but the formal details are tedious reading, and may be familiar to many readers, so the full definitions of the terms marked in italics are relegated to a Glossary at the end of the article.

Two ways of visualizing the space $\mathbb B^k$ of $2^k\!$ points are the hypercube picture and the venn diagram picture. The hypercube picture associates each point of $\mathbb B^k$ with a unique point of the $k\!$-dimensional hypercube. The venn diagram picture associates each point of $\mathbb B^k$ with a unique "cell" of the venn diagram on $k\!$ "circles".

In addition, each point of $\mathbb B^k$ is the unique point in the fiber of truth $[|s|]\!$ of a singular proposition $s : \mathbb B^k \to \mathbb B,$ and thus it is the unique point where a singular conjunction of $k\!$ literals is $1.\!$

For example, consider two cases at opposite vertices of the cube:

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)\!$ &mdash; written more simply as $\mathsf{(p, q, r)}$ &mdash; has the following venn diagram:

For a contrasting example, the boolean function expressed by the form $\mathsf{((p),(q),(r))}$ has the following venn diagram:

Glossary of basic terms

 * Boolean Domain
 * A boolean domain $\mathbb B$ is a generic 2-element set, say, $\mathbb B = \left\{{0, 1}\right\}$, whose elements are interpreted as logical values, usually, but not invariably, with $0 = \operatorname{false}$ and $1 = \operatorname{true}$.


 * Boolean Variable
 * A boolean variable $x\!$ is a variable that takes its value from a boolean domain, as $x \in \mathbb B$.


 * Proposition
 * In situations where boolean values are interpreted as logical values, a boolean-valued function $f : X \to \mathbb B$, or a boolean function $g : \mathbb B^k \to \mathbb B$ is frequently called a proposition.


 * Basis Element, Coordinate Projection
 * Given a sequence of $k\!$ boolean variables, $x_1, \ldots, x_k,\!$ each variable $x_j\!$ may be viewed either as a basis element of the cartesian space $\mathbb B^k$ or as a coordinate projection $x_j : \mathbb B^k \to \mathbb B$.


 * Basic Proposition
 * A basic proposition is one of the above coordinate projections, $x_j : \mathbb B^k \to \mathbb B$, viewed in the light of a logical interpretation, typically, $0 = \operatorname{false}$ and $1 = \operatorname{true}$. The set of $k\!$ basic propositions generates the full set of $2^{2^k}$ propositions over $\mathbb B^k$.


 * Literal
 * A literal is one of the $2k\!$ propositions $x_1, \ldots, x_k, \mathsf{(} x_1 \mathsf{)}, \ldots, \mathsf{(} x_k \mathsf{)}$, in other words, either a posited basic proposition $x_j\!$ or a negated basic proposition $\mathsf{(} x_j \mathsf{)},$ for some $j = 1 ~\text{to}~ k.$


 * Fiber
 * In mathematics generally, the fiber of a point $y \in Y$ under a function $f : X \to Y$ is defined as the inverse image $f^{-1}(y) \in X$.


 * Boolean Fiber
 * In the case of a boolean-valued function $f : X \to \mathbb B$, there are just two fibers:
 * The fiber of 0 under $f\!$, defined as $f^{-1}(0)\!$, is the set of points in $X\!$ where $f\!$ is 0.
 * The fiber of 1 under $f\!$, defined as $f^{-1}(1)\!$, is the set of points in $X\!$ where $f\!$ is 1.


 * Fiber of Truth
 * When 1 is interpreted as the logical value true, then $f^{-1}(1)\!$ is called the fiber of truth in the proposition $f\!$. Frequent mention of this fiber makes it useful to have a shorter way of referring to it.  This leads to the definition of the notation $[|f|] = f^{-1}(1)\!$ for the fiber of truth in the proposition $f\!$.


 * Singular Boolean Function
 * A singular boolean function $s : \mathbb B^k \to \mathbb B$ is a boolean function whose fiber of 1 is a single point of $\mathbb B^k$.


 * Singular Proposition
 * When the boolean domain $\mathbb B = \{ 0, 1 \}$ is given a logical interpretation, a singular boolean function is called a singular proposition. Singular boolean functions and singular propositions serve as functional or logical representatives of the points in $\mathbb B^k$.


 * Singular Conjunction
 * A singular conjunction in the set of propositions of type $\mathbb B^k \to \mathbb B$ is a conjunction of $k\!$ literals that includes just one conjunct of the pair $\{ x_j, ~ \nu (x_j) \}$ for each $j = 1 ~\text{to}~ k$.


 * A singular proposition $s : \mathbb B^k \to \mathbb B$ can be expressed as a singular conjunction: