Cactus Language • Preliminaries 12

We are engaged in teasing out the consequences of the following description of our subject.

The painted cactus language with paints in the set \mathfrak{P} = \{ p_j : j \in J \} is the formal language \mathfrak{L} = \mathfrak{C} (\mathfrak{P}) \subseteq \mathfrak{A}^* = (\mathfrak{M} \cup \mathfrak{P})^* defined as follows.

\begin{array}{ll}  \text{PC 1.} & \text{The blank symbol}~ m_1 ~\text{is a sentence.}  \\  \text{PC 2.} & \text{The paint}~ p_j ~\text{is a sentence for each}~ j ~\text{in}~ J.  \\  \text{PC 3.} & \mathrm{Conc}^0 ~\text{and}~ \mathrm{Surc}^0 ~\text{are sentences.}  \\  \text{PC 4.} & \text{For each positive integer}~ n,  \\  & \text{if}~ s_1, \ldots, s_n ~\text{are sentences}  \\  & \text{then}~ \mathrm{Conc}_{k=1}^n s_k ~\text{is a sentence}  \\  & \text{and}~ \mathrm{Surc}_{k=1}^n s_k ~\text{is a sentence.}  \end{array}

Only one thing remains to cast that description of cactus language into a commonly acceptable form.  As presently formulated, the principle PC 4 appears to be attempting to define an infinite number of new concepts all in a single step, at least, it appears to invoke the indefinitely long sequences of operators \mathrm{Conc}^n and \mathrm{Surc}^n for all n > 0.

As a general rule one prefers to work with effectively finite descriptions of conceptual objects.  That means restricting each description to a finite number of schematic principles, each of which involves a finite number of schematic effects.  In that way we hope to arrive at a finite number of schemata explicitly relating conditions to results.

Resources

cc: Academia.edu • BlueSky • Laws of FormMathstodonResearch Gate
cc: Conceptual GraphsCyberneticsStructural ModelingSystems Science

This entry was 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 and tagged , , , , , , , , , , , , , , , , . Bookmark the permalink.

2 Responses to Cactus Language • Preliminaries 12

  1. Pingback: Survey of Animated Logical Graphs • 8 | Inquiry Into Inquiry

  2. Pingback: Survey of Animated Logical Graphs • 8 | Systems Community of Inquiry

Leave a comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.