Animated Logical Graphs • 20

Another tactic I tried by way of porting operator variables into logical graphs and laws of form was to hollow out a leg of Spencer Brown’s crosses, gnomons, markers, whatever you wish to call them, as shown below.

Transitional Form (q)_p = {q,(q)}

The initial idea I had in mind was the same as before, that the operator over q would be counted as absent when p evaluates to a space and present when p evaluates to a cross.

However, much in the same way operators with a shade of negativity tend to be more generative than the purely positive brand, it turned out more useful to reverse this initial polarity of operation, letting the operator over q be counted as absent when p evaluates to a cross and present when p evaluates to a space.

So that is the convention I’ll adopt from this point on.

cc: Cybernetics (1) (2) • Peirce (1) (2) (3) (4) (5) (6) (7) (8) (9) (10) (11) (12) (13) (14)
cc: Ontolog Forum (1) (2) • Structural Modeling (1) (2) • Systems Science (1) (2)
cc: FB | Logical GraphsLaws of Form

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.