Theme One Program • Discussion 8

Re: Theme One Program • Exposition (1) (2) (3) (4)
Re: Theme One Program • Discussion (7)
Re: Ontolog Forum • Alex Shkotin (1) (2)
Re: Logical Graphs • Animated Proofs

The animation is mesmerizing:  I would watch and watch.  But without the pause, next frame, and playback speed settings, it’s just a work of art that calls to see it step by step.

And on [the following] page you start with the double negation theorem.

Have a look at a few of my comments as a reader, and only on the graph topic taken separately.

Dear Alex,

Thanks for viewing the animations and taking the time to work through that first proof.  Clearly a lot could be done to improve the production values — what you see is what I got with whatever app I had umpteen years ago.

For the time being I’m focusing on the implementation layer of the Theme One Program, which combines a learning component and a reasoning component.  The first implements a two‑level sequence learner and the second implements a propositional calculator based on a variant of Peirce’s logical graphs.  (I meant to say more about the learning function this time around but I’m still working up to tackling that.)

To address your comments and questions we’ll need to step back for a moment to a more abstract, implementation-independent treatment of logical graphs.  There’s a number of resources along that line linked on the following Survey page.

The post “Logical Graphs • Formal Development” gives a quick but systematic account of the formal system I use throughout.  The OEIS wiki article “Logical Graphs” gives a more detailed development.

Here’s an excerpt from the above discussions, giving the four axioms or “initials” which serve as graphical transformation rules, in effect, the equational inference rules used to generate proofs and establish theorems or “consequences”.


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



The statement of the Double Negation Theorem is shown below.

C1.  Double Negation Theorem

The first theorem goes under the names of Consequence 1 (C1), the double negation theorem (DNT), or Reflection.

Double Negation Theorem

The following proof is adapted from the one given by George Spencer Brown in his book Laws of Form (LOF) and credited to two of his students, John Dawes and D.A. Utting.

Double Negation Theorem • Proof

That should fill in enough background to get started on your questions …


cc: Conceptual GraphsCyberneticsLaws of FormOntolog Forum
cc: FB | Theme One ProgramStructural ModelingSystems Science

This entry was posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization and tagged , , , , , , , , , , , , , , , , , , , , , , , , , , . Bookmark the permalink.

2 Responses to Theme One Program • Discussion 8

  1. Pingback: Survey of Theme One Program • 4 | Inquiry Into Inquiry

  2. Pingback: Theme One Program • Discussion 9 | 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.