Monthly Archives: September 2025

Cactus Language • Mechanics 4

To develop a parser for cactus languages in a functional programming style takes a way to express the description of a PARC in terms of its nodes, by recursion from the root up.  That requires each node to be specified … 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 , , , , , , , , , , , , , , , , | 3 Comments

Cactus Language • Mechanics 3

Although the definition of a cactus graph lobe in terms of its intrinsic structural components is logically sufficient it is also useful to characterize the structure of a lobe in extrinsic relational terms, that is, to view the structure that … 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

Cactus Language • Mechanics 2

The structure of a painted cactus, insofar as it presents itself to the visual imagination, can be described as follows.  The overall structure, as given by its underlying graph, falls within the species of graph commonly known as a rooted … 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

Cactus Language • Discussion 3

Re: Cactus Language • Stylistics 1 Re: Cybernetics • Shann Turnbull ST: How does your posting meet the test of being relevant to the Wiener definition of Cybernetic? Cybernetics can explain how all living things are self‑regulating, self‑governing and to … 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 , , , , , , , , , , , , , , , , | 3 Comments

Cactus Language • Mechanics 1

We are only now beginning to see how this works.  Clearly one of the mechanisms for picking a reality is the sociohistorical sense of what is important — which research program, with all its particularity of knowledge, seems most fundamental, … 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 , , , , , , , , , , , , , , , , | 3 Comments

Charles Sanders Peirce, George Spencer Brown, and Me • 20

Re: Laws of Form • James Bowery JB: I’m interested in those who have approached the notion of self‑duality from the meta‑perspective of switching perspectives between Directed Cyclic Graphs of NiNAND and NiNOR gates (Ni for N‑Inputs à la boolean … Continue reading

Posted in Abstraction, Amphecks, Analogy, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Cybernetics, Deduction, Differential Analytic Turing Automata, Differential Logic, Duality, Form, Graph Theory, Inquiry, Inquiry Driven Systems, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Proof Theory, Propositional Calculus, Semiotics, Sign Relational Manifolds, Sign Relations, Spencer Brown, Theorem Proving, Time, Topology | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Charles Sanders Peirce, George Spencer Brown, and Me • 19

Re: Laws of Form • James Bowery JB: I’m interested in those who have approached the notion of self‑duality from the meta‑perspective of switching perspectives between Directed Cyclic Graphs of NiNAND and NiNOR gates (Ni for N‑Inputs à la boolean … Continue reading

Posted in Abstraction, Amphecks, Analogy, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Cybernetics, Deduction, Differential Analytic Turing Automata, Differential Logic, Duality, Form, Graph Theory, Inquiry, Inquiry Driven Systems, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Proof Theory, Propositional Calculus, Semiotics, Sign Relational Manifolds, Sign Relations, Spencer Brown, Theorem Proving, Time, Topology | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Charles Sanders Peirce, George Spencer Brown, and Me • 18

Re: Laws of Form • James Bowery JB: I’m interested in those who have approached the notion of self‑duality from the meta‑perspective of switching perspectives between Directed Cyclic Graphs of NiNAND and NiNOR gates (Ni for N‑Inputs à la boolean … Continue reading

Posted in Abstraction, Amphecks, Analogy, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Cybernetics, Deduction, Differential Analytic Turing Automata, Differential Logic, Duality, Form, Graph Theory, Inquiry, Inquiry Driven Systems, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Proof Theory, Propositional Calculus, Semiotics, Sign Relational Manifolds, Sign Relations, Spencer Brown, Theorem Proving, Time, Topology | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment