Jon Awbrey<p>Cactus Language • Overview 1.1<br>• <a href="https://inquiryintoinquiry.com/2025/03/01/cactus-language-overview-1/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">inquiryintoinquiry.com/2025/03</span><span class="invisible">/01/cactus-language-overview-1/</span></a></p><p>❝Thus, what looks to us like a sphere of scientific knowledge more accurately should be represented as the inside of a highly irregular and spiky object, like a pincushion or porcupine, with very sharp extensions in certain directions, and virtually no knowledge in immediately adjacent areas. If our intellectual gaze could shift slightly, it would alter each quill’s direction, and suddenly our entire reality would change.❞</p><p>— Herbert J. Bernstein • “Idols of Modern Science”</p><p>The following report describes a calculus for representing propositions as sentences, that is, as syntactically defined sequences of signs, and for working with those sentences in light of their semantically defined contents as logical propositions. In their computational representation the expressions of the calculus parse into a class of graph‑theoretic data structures whose underlying graphs are called “painted cacti”.</p><p>Painted cacti are a specialization of what graph‑theorists refer to as “cacti”, which are in turn a generalization of what they call “trees”. The data structures corresponding to painted cacti have especially nice properties, not only useful in computational terms but interesting from a theoretical standpoint. The remainder of the present Overview is devoted to motivating the development of the indicated family of formal languages, going under the generic name of Cactus Language.</p><p><a href="https://mathstodon.xyz/tags/Peirce" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Peirce</span></a> <a href="https://mathstodon.xyz/tags/Logic" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Logic</span></a> <a href="https://mathstodon.xyz/tags/Semiotics" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Semiotics</span></a> <a href="https://mathstodon.xyz/tags/LogicalGraphs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>LogicalGraphs</span></a> <a href="https://mathstodon.xyz/tags/DifferentialLogic" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>DifferentialLogic</span></a> <br><a href="https://mathstodon.xyz/tags/Automata" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Automata</span></a> <a href="https://mathstodon.xyz/tags/FormalLanguages" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>FormalLanguages</span></a> <a href="https://mathstodon.xyz/tags/FormalGrammars" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>FormalGrammars</span></a> <a href="https://mathstodon.xyz/tags/GraphTheory" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>GraphTheory</span></a></p>