Animated Logical Graphs • 21

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}, in which the operand {}^{\backprime\backprime} a {}^{\prime\prime} suggests the contemplated absence or presence of any arithmetic expression or its value, then 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 indicated by a cross or a space, respectively, for the value of a newly introduced variable, {}^{\backprime\backprime} b {}^{\prime\prime}, placed in a new slot of a newly extended operator form, as suggested by the following picture.

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 Space = False and Cross = True,
    calls this operation equivalence.
  • The Existential Interpretation (\mathrm{Ex}), for which Space = True and Cross = False,
    calls this operation distinction.

cc: Cybernetics (1) (2) • Peirce (1) (2) (3) (4) (5) (6) (7) (8) (9) (10) (11) (12) (13) (14)
cc: Ontolog Forum (1) (2) • Structural Modeling (1) (2) • Systems Science (1) (2)
cc: FB | Logical GraphsLaws of Form

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.