Operator Variables in Logical Graphs • 7

Re: Operator Variables in Logical Graphs • 6

A funny thing just happened.  Let’s see if we can tell where.  We started with the algebraic expression {}^{\backprime\backprime} \texttt{(} a \texttt{)} {}^{\prime\prime}, where the operand {}^{\backprime\backprime} a {}^{\prime\prime} suggests the contemplated absence or presence of an arbitrary arithmetic expression.  Next we contemplated the absence or presence of the operator {}^{\backprime\backprime} \texttt{(} ~ \texttt{)} {}^{\prime\prime} in {}^{\backprime\backprime} \texttt{(} a \texttt{)} {}^{\prime\prime} to be determined by the value of a newly introduced variable, say {}^{\backprime\backprime} b {}^{\prime\prime}, which is placed in a new slot of a newly extended operator form, as suggested by the following Figure.

Control Form (a)_b

What happened here is this.  Our contemplation of a constant operator as being potentially variable gave rise to the contemplation of a newly introduced but otherwise quite ordinary operand variable, albeit in a newly-fashioned formula.  In its interpretation for logic the newly formed operation may be viewed as an extension of ordinary negation, one in which the negation of the first variable is controlled by the value of the second variable.

We may regard this development as marking a form of controlled reflection, or a form of reflective control.  From here on out we’ll use the inline syntax {}^{\backprime\backprime} \texttt{(} a \texttt{,} b \texttt{)} {}^{\prime\prime} to indicate the corresponding operation on two variables, whose formal operation table is given below.

Formal Operation Table (a,b)

  • The Entitative Interpretation (\mathrm{En}), for which \texttt{Space} = \texttt{False} and \texttt{Cross} = \texttt{True},
    calls this operation logical equality.
  • The Existential Interpretation (\mathrm{Ex}), for which \texttt{Space} = \texttt{True} and \texttt{Cross} = \texttt{False},
    calls this operation logical difference.

cc: FB | Logical GraphsLaws of FormMathstodonAcademia.edu
cc: Conceptual GraphsCyberneticsStructural ModelingSystems Science

This entry was posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Equational Inference, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Peirce, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Theorem Proving, Visualization and tagged , , , , , , , , , , , , , , , , , , , , , , , , , . Bookmark the permalink.

2 Responses to Operator Variables in Logical Graphs • 7

  1. Pingback: Survey of Animated Logical Graphs • 7 | Inquiry Into Inquiry

  2. Pingback: Operator Variables in Logical Graphs • 8 | Inquiry Into Inquiry

Leave a comment

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