Discussion arose in the Laws Of Form Group about computational explorations of George Spencer Brown’s calculus of indications.
Readers of Peirce are generally aware Spencer Brown revived certain aspects of Peirce’s logical graphs, focusing on what Peirce called the Alpha level and its interpretation for Boolean Algebra and Propositional Calculus but adding hints of potential extension and generalization. Spencer Brown used what amounts to Peirce’s entitative interpretation of the graphical forms in his exposition but he was clear about the abstract character of the forms themselves, as evidenced by their dual interpretations, dubbed entitative and existential by Peirce.
In computational contexts the question naturally arises how to code the abstract formal structures used by the calculi of CSP and GSB into the relatively concrete forms that a computer can process.
I began my response to that question as follows …
To be continued …
Inquiry Into Inquiry 
Pingback: Survey of Theme One Program • 2 | Inquiry Into Inquiry
Pingback: Survey of Theme One Program • 2 | Inquiry Into Inquiry
Pingback: Survey of Theme One Program • 3 | Inquiry Into Inquiry
Pingback: Survey of Theme One Program • 4 | Inquiry Into Inquiry