Animated Logical Graphs • 26

This post and the next wrap up the Themes and Variations section of my speculation on Futures Of Logical Graphs.  I made an effort to “show my work”, reviewing the steps I took to arrive at the present perspective on logical graphs, whistling past the least productive of the blind alleys, cul-de-sacs, detours, and forking paths I explored along the way.  It can be useful to tell the story that way, partly because others may find things I missed down those roads, but it does call for a recap of the main ideas I would like readers to take away.

Partly through my reflections on Peirce’s use of operator variables I was led to what I called the reflective extension of logical graphs, or what I now call the “cactus language”, after its principal graph-theoretic data structure.  This graphical formal language arises from generalizing the negation operator {}^{\backprime\backprime} \texttt{(} ~ \texttt{)} {}^{\prime\prime} in a particular direction, treating {}^{\backprime\backprime} \texttt{(} ~ \texttt{)} {}^{\prime\prime} as the controlled, moderated, or reflective negation operator of order 1, and adding another operator for each integer parameter greater than 1.  This family of operators is symbolized by bracketed argument lists of the forms {}^{\backprime\backprime} \texttt{(} ~ \texttt{)} {}^{\prime\prime}, {}^{\backprime\backprime} \texttt{(} ~ \texttt{,} ~ \texttt{)} {}^{\prime\prime}, {}^{\backprime\backprime} \texttt{(} ~ \texttt{,} ~ \texttt{,} ~ \texttt{)} {}^{\prime\prime}, and so on, where the number of places is the order of the reflective negation operator in question.

Two rules suffice for evaluating cactus graphs:

  • The rule for evaluating a k-node operator, corresponding to an expression of the form {}^{\backprime\backprime} x_1 x_2 \ldots x_{k-1} x_k {}^{\prime\prime}, is as follows:

    Node Evaluation Rule

  • The rule for evaluating a k-lobe operator, corresponding to an expression of the form {}^{\backprime\backprime} \texttt{(} x_1 \texttt{,} x_2 \texttt{,} \ldots \texttt{,} x_{k-1} \texttt{,} x_k \texttt{)} {}^{\prime\prime}, is as follows:

    Lobe Evaluation Rule

cc: Systems ScienceStructural ModelingOntolog ForumLaws of FormCybernetics

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 Animated Logical Graphs • 26

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

  2. Pingback: Animated Logical Graphs • 27 | 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.