Cactus Language • Syntax 8

Grammar 3 (concl.)

Returning to the cactus language \mathfrak{C} (\mathfrak{P}) and fixing the parameter \mathfrak{P} for the moment, we have a language \mathrm{Parce} of painted and rooted cactus expressions.  It serves the purpose of efficient accounting to divide the language into two sublanguages.

  • The emptily painted and rooted cactus expressions make up the language \mathrm{EParce} which consists of a single empty string as its only sentence.

\mathrm{EParce} = \underline\varepsilon = \{ \varepsilon \}

  • The significantly painted and rooted cactus expressions make up the language \mathrm{SParce} which consists of everything else, namely, all the non‑empty strings in the language \mathrm{Parce}.

\mathrm{SParce} = \mathrm{Parce} \setminus \varepsilon

Marking the distinction between empty and significant sentences effectively categorizes each of the three classes of strings as an entity unto itself and conceives the whole of its membership as falling under a distinctive symbol, thereby obtaining the following equation among the three sublanguages.

\mathrm{SParce} = \mathrm{Parce} - \mathrm{EParce}

That makes \mathrm{Parce} the disjoint union of \mathrm{EParce} and \mathrm{SParce}.

\mathrm{Parce} = \mathrm{EParce} \cup \mathrm{SParce}

For brevity in the present case, and to serve as a generic device in similar situations, let S be the type of an arbitrary sentence, possibly empty, and let S' be the type of a non‑empty sentence.

In addition, let \underline\varepsilon be the type of the empty sentence, in effect, the language \underline\varepsilon = \{ \varepsilon \} containing a single empty string, and let a plus sign ``+" signify a disjoint union of types.  In the most general type of situation, where the type S is permitted to include the empty string, one notes the following relation among types.

S = \underline\varepsilon + S'

With the distinction between empty and significant expressions in mind, we return to the analysis of the cactus language \mathfrak{L} = \mathfrak{C} (\mathfrak{P}) = \mathrm{Parce} (\mathfrak{P}) afforded by Grammar 2, and, taking that as a point of departure, explore other avenues of possible improvement in the comprehension of its expressions.

To observe the effects of the alteration as clearly as possible in isolation from other factors it is useful to strip away the higher levels of intermediate organization presented by Grammar 3 and start again with a single intermediate symbol, as used in Grammar 2.  One way to execute that strategy leads to a style of grammar we take up next.

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 • Syntax 8

  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.