Minimal Negation Operators • 1

To accommodate moderate levels of complexity in the application of logical graphs to practical problems our Organon requires a class of organules called “minimal negation operators” (mnos).  I outlined the history of their early development from Peirce’s alpha graphs for propositional calculus in a previous series of posts.  The next order of business is to sketch their properties in a systematic fashion and to illustrate their uses.  As it turns out, taking mnos as primitive operators enables extremely efficient expressions for many natural constructs and affords a bridge between boolean domains of two values and domains with finite numbers of values, for example, finite sets of individuals.

Brief Introduction

A minimal negation operator (\nu) is a logical connective which says “just one false” of its logical arguments.  The first four cases are described below.

  1. If the list of arguments is empty, as expressed in the form \nu(), then it cannot be true exactly one of the arguments is false, so \nu() = \mathrm{false}.
  2. If p is the only argument then \nu(p) says p is false, so \nu(p) expresses the negation of the proposition p.  Written in several common notations we have the following equivalent expressions.

    \nu(p) ~=~ \mathrm{not}(p) ~=~ \lnot p ~=~ \tilde{p} ~=~ p^{\prime}

  3. If p and q are the only two arguments then \nu(p, q) says exactly one of p, q is false, so \nu(p, q) says the same thing as p \neq q.  Expressing \nu(p, q) in terms of ands (\cdot), ors (\lor), and nots (\tilde{~}) gives the following form.

    \nu(p, q) ~=~ \tilde{p} \cdot q ~\lor~ p \cdot \tilde{q}

    It is permissible to omit the dot (\cdot) in contexts where it is understood, giving the following form.

    \nu(p, q) ~=~ \tilde{p}q \lor p\tilde{q}

    The venn diagram for \nu(p, q) is shown in Figure 1.

    ν(p, q)

    \text{Figure 1.} ~~ \nu(p, q)

  4. The venn diagram for \nu(p, q, r) is shown in Figure 2.

    ν(p, q, r)

    \text{Figure 2.} ~~ \nu(p, q, r)

    The center cell is the region where all three arguments p, q, r hold true, so \nu(p, q, r) holds true in just the three neighboring cells.  In other words:

    \nu(p, q, r) ~=~ \tilde{p}qr \lor p\tilde{q}r \lor pq\tilde{r}

Resources

cc: CyberneticsOntolog ForumPeirce ListStructural ModelingSystems Science
cc: FB | Minimal Negation OperatorsLaws of Form

This entry was posted in Amphecks, Animata, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Functional Logic, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Semiotics, Venn Diagrams, Visualization and tagged , , , , , , , , , , , , , , , , , , , . Bookmark the permalink.

6 Responses to Minimal Negation Operators • 1

  1. Pingback: Minimal Negation Operators • 2 | Inquiry Into Inquiry

  2. Pingback: Minimal Negation Operators • 2 | Inquiry Into Inquiry

  3. Pingback: Minimal Negation Operators • 5 | Inquiry Into Inquiry

  4. Pingback: Minimal Negation Operators • Discussion 1 | Inquiry Into Inquiry

  5. Pingback: Survey of Animated Logical Graphs • 4 | Inquiry Into Inquiry

  6. Pingback: Minimal Negation Operators • Discussion 2 | Inquiry Into Inquiry

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.