< Minimal Negation Operator
(logic, wiki, imported, Proteus)

In logic and mathematics, the minimal negation operator ν is a multigrade operator (ν_k)_k∈N where each ν_k is a k-ary boolean function defined in such a way that ν_k(x₁, …, x_k) = 1 if and only if exactly one of the arguments x_j is 0.

In contexts where the initial letter ν 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.

( ) & = & 0 & = & mbox{false} (x) & = & tilde{x} & = & x' (x, y) & = & tilde{x}y lor xtilde{y} & = & x'y lor xy' (x, y, z) & = & tilde{x}yz lor xtilde{y}z lor xytilde{z} & = & x'yz lor xy'z lor xyz' end{matrix}

It may also be noted that is the same function as and , and that the inclusive disjunctions indicated for and for may be replaced with exclusive disjunctions without affecting the meaning, because the terms disjoined are already disjoint. However, the function is not the same thing as the function .

The minimal negation operator (mno) has a legion of aliases: logical boundary operator, limen operator, threshold operator, or least action operator, to name but a few. The rationale for these names is visible in the venn diagrams of the corresponding operations on sets.

The next section discusses two ways of visualizing the operation of minimal negation operators. A few bits of terminology will be needed as a language for talking about the pictures, but the formal details are tedious reading, and may already be familiar to many. As a result, the full definitions of the terms marked in bold are relegated to a Glossary at the end of the article.

Truth tables

Table 1 is a truth table for the sixteen boolean functions of type f : B³ → B, each of which is either a boundary of a point in B³ or the complement of such a boundary.

|+ Table 1. Logical Boundaries and Their Complements ₁₂₃₄ | Decimal | Binary | Sequential | Parenthetical |   |   |  

L	L	L	L
p = | 1 1 1 1 0 0 0 0 |
q = | 1 1 0 0 1 1 0 0 |
r = | 1 0 1 0 1 0 1 0 |

_10401101000 > > > > > > > > > > > > > >

f	f	0 1 1 0 1 0 0 0	( p , q , r )
148	10010100	| ( p , q , (r))
146	10010010	| ( p , (q), r )
97	01100001	| ( p , (q), (r))
134	10000110	| ((p), q , r )
73	01001001	| ((p), q , (r))
41	00101001	| ((p), (q), r )
22	00010110	| ((p), (q), (r))

_23311101001 > > > > > > > > > > > > > >

f	f	1 1 1 0 1 0 0 1	(((p), (q), (r)))
214	11010110	| (((p), (q), r ))
182	10110110	| (((p), q , (r)))
121	01111001	| (((p), q , r ))
158	10011110	| (( p , (q), (r)))
109	01101101	| (( p , (q), r ))
107	01101011	| (( p , q , (r)))
151	10010111	| (( p , q , r ))

Charts and graphs

Two common ways of visualizing the space B^k of 2^k points are the hypercube picture and the venn diagram picture. Depending on how literally or figuratively one regards these pictures, each point of B^k is either identified with or represented by a point of the k-cube and also by a cell of the venn diagram on k "circles".

In addition, each point of B^k is the unique point in the fiber of truth of a singular proposition s : B^k → 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:

• The point whose coordinates are all 1 is the unique point where the conjunction of all posited variables is 1, namely, the point where:

• The point whose coordinates are all 0 is the unique point where the conjunction of all negated variables is 1, namely, the point where:

To pass from these limiting examples to the general case, observe that a singular proposition s : B^k → B can be given canonical expression as a conjunction of literals, s = e₁ e₂ … e_k–1 e_k. Then the proposition ν(e₁, e₂, …, 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 ν(p, q, r), when there is no risk of confusion written more simply as , has the following venn diagram:



For a contrasting example, the boolean function expressed by the form has the following Venn diagram:

Glossary of basic terms

• A boolean domain B is a generic 2-element set, say, B = {0, 1}, whose elements are interpreted as logical values, usually but not invariably with 0 = false and 1 = true.

• A boolean variable x is a variable that takes its value from a boolean domain, as x ∈ B.

• In situations where boolean values are interpreted as logical values, a boolean-valued function f : X → B or a boolean function g : B^k → B is frequently called a proposition.

• Given a sequence of k boolean variables, x₁, …, x_k, each variable x_j may be treated either as a basis element of the space B^k or as a coordinate projection x_j : B^k → B.

• This means that the k objects x_j for j = 1 to k are just so many boolean functions x_j : B^k → B , subject to logical interpretation as a set of basic propositions that generate the complete set of 2^2k propositions over B^k.

• A literal is one of the 2k propositions x₁, …, x_k, (x₁), …, (x_k), in other words, either a posited basic proposition x_j or a negated basic proposition (x_j), for some j = 1 to k.

• In mathematics generally, the fiber of a point y under a function f : X → Y is defined as the inverse image f^–1(y).

• In the case of a boolean function f : B^k → B, there are just two fibers:
• The fiber of 0 under f, defined as f^–1(0), is the set of points where f is 0.
• The fiber of 1 under f, defined as f^–1(1), is the set of points where f is 1.

• 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.

• A singular boolean function s : B^k → B is a boolean function whose fiber of 1 is a single point of B^k.

• In the interpretation where 1 equals true, 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 B^k.

• A singular conjunction in B^k → B is a conjunction of k literals that includes just one conjunct of the pair {x_j, ν(x_j)} for each j = 1 to k.

• A singular proposition s : B^k → B can be expressed as a singular conjunction:
se₁e₂ … e_k–1e_k, |   | where | e_j | = | x_j |   | or | e_j | = | ν(x_j), |   | for | j | = | 1 to k.

			=





References

See also

|+  

Ampheck Anamnesis BACD Boole, George Boolean algebra Boolean function Boolean logic Boolean-valued function

Continuous predicate Differentiable manifold Differential topology Dynamical system Exclusive disjunction Leibniz, G.W. Logical connective Logical graph

Meno Multigrade operator Parametric operator Peirce, C.S. Sole sufficient operator Truth table Universal algebra Zeroth order logic





External links

• Wolfram Atlas of Simple Programs
• ECARs (Elementary Cellular Automata Rules)
• ECAR Index
• ECAR Rule Icons
• ECAR Examples
• ECAR Boolean Forms



missing image!
- Minimal negation operator 1.png -
Figure 1. Region indicated by (p, q, r) is shaded



missing image!
- Minimal negation operator 2.png -
Figure 2. Region indicated by ((p),(q),(r)) is shaded






---

Some content adapted from the Wikinfo article "Minimal negation operator" under the GNU Free Documentation License.

(last updated by Proteus, 6:16pm CDT - Sat, Apr 07 2007)
export article | talk about article