Daily Archives: June 15, 2025

Cactus Language • Syntax 8

Grammar 3 (concl.) Returning to the cactus language and fixing the parameter for the moment, we have a language of painted and rooted cactus expressions.  It serves the purpose of efficient accounting to divide the language into two sublanguages. The emptily … Continue reading

Posted in Automata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Differential Logic, Equational Inference, Formal Grammars, Formal Languages, Graph Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , | 2 Comments