Daily Archives: June 17, 2025

Cactus Language • Syntax 9

Grammar 4 If one imposes the distinction between empty and significant types on each non‑terminal symbol in Grammar 2 then the symbols and give rise to the expanded set of non‑terminal symbols leaving the last three to form a new intermediate … 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