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

AS:

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.

• Propositional Equation Reasoning Systems

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.

• Survey of Animated Logical Graphs

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”.

Axioms

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.

C₁.  Double Negation Theorem

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

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.

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

Resources

• Theme One Program • Overview
• Theme One Program • Exposition
• Theme One Program • User Guide
• Theme One Program • Survey Page

cc: Conceptual Graphs • Cybernetics • Laws of Form • Ontolog Forum
cc: FB | Theme One Program • Structural Modeling • Systems Science