Charles Sanders Peirce, George Spencer Brown, and Me • 6

The formal system of logical graphs is defined by a foursome of formal equations, called initials when regarded purely formally, in abstraction from potential interpretations, and called axioms when interpreted as logical equivalences.  There are two arithmetic initials and two algebraic initials, as shown below.

Arithmetic Initials



Algebraic Initials



Spencer Brown uses a different formal equation for his first algebraic initial — where I use  a \texttt{(} a \texttt{)} = \texttt{(~)}  he uses  \texttt{(} a \texttt{(} a \texttt{))} = ~~.  For the moment, let’s refer to my \mathrm{J_1} as \mathrm{J_{1a}} and his \mathrm{J_1} as \mathrm{J_{1b}} and use that notation to examine the relationship between the two systems.

It is easy to see that the two systems are equivalent, since we have the following proof of \mathrm{J_{1b}} by way of \mathrm{J_{1a}} and \mathrm{I_2}.

 a   a

 =======J1a {delete}


 =======I2  {cancel}


 =======QED J1b

In choosing between systems I am less concerned with small differences in the lengths of proofs than I am with other factors.  It is difficult for me to remember all the reasons for decisions I made forty or fifty years ago — as a general rule, Peirce’s way of looking at the relation between mathematics and logic has long been a big influence on my thinking and the other main impact is accountable to the nuts and bolts requirements of computational representation.

But looking at the choice with present eyes, I think I continue to prefer the \mathrm{I_1, I_2, J_{1a}, J_2} system over the alternative simply for the fact it treats two different types of operation separately, namely, changes in graphical structure versus changes in the placement of variables.

cc: CyberneticsLaws of FormOntologPeirceStructural ModelingSystems Science

This entry was posted in Abstraction, Amphecks, Analogy, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Cybernetics, Deduction, Differential Logic, Duality, Form, Graph Theory, Inquiry, Inquiry Driven Systems, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Peirce, Proof Theory, Propositional Calculus, Semiotics, Sign Relational Manifolds, Sign Relations, Spencer Brown, Theorem Proving, Time, Topology and tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , . Bookmark the permalink.

2 Responses to Charles Sanders Peirce, George Spencer Brown, and Me • 6

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

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

Leave a Reply

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

You are commenting using your 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.