Cactus Language • Syntax 5

Grammar 2

One way to analyze the surcatenation of any number of sentences is to introduce an auxiliary type of string, not itself a sentence but a proper component of any sentence formed by surcatenation.  Doing that brings one to the following definition.

A tract is a concatenation of a finite sequence of sentences, with a literal comma ``," interpolated between each pair of adjacent sentences.  Thus, a typical tract T takes the following form.

\begin{array}{lllllllllll}  T & = & S_1 & \cdot & ``," & \cdot & \ldots & \cdot & ``," & \cdot & S_k  \end{array}

A tract of that type must be distinguished from the abstract sequence of sentences, S_1, \ldots, S_k, where the commas coming to mind, as if being called up to separate the successive sentences of the sequence, remain as partially abstract conceptions, or as signs retaining a disengaged status on the borderline between text and mind.  The kinds of commas appearing in the abstract sequence continue to exist as conceptual abstractions and fail to be cognized in a wholly explicit fashion, either as concrete tokens in the object language or as marks in the text engaging one’s parsing attention.

Returning to the painted cactus language \mathfrak{L} = \mathfrak{C} (\mathfrak{P}), it is possible to put the assembled pieces of grammar together in the light of the adopted canons of style to refine our analysis of the fact that the concept of a sentence covers any concatenation of sentences and any surcatenation of sentences, and so arrive at the following form of grammar.

Cactus Language Grammar 2

In that rendition, a string of type T is not in general a sentence itself but a proper part of speech, that is, a strictly lesser component of a sentence in any suitable ordering of sentences and their components.  In order to see how the grammatical category T gets off the ground, that is, to detect its minimal strings and to discover how its ensuing generations take their start from those, it is useful to observe that the covering rule T :> S means that T inherits all the initial conditions of S, namely, T :> \varepsilon, m_1, p_j.  In accord with those simple beginnings it comes to pass that the rule T :> T \cdot ``," \cdot S, with the substitutions T = \varepsilon and S = \varepsilon, bears the germinal implication that T :> ``,".

Grammar 2 achieves a portion of its success through a higher degree of intermediate organization.  The level of organization is reflected in the size of the intermediate alphabet \mathfrak{Q} = \{ ``T" \} but the number of symbols alone does not give a full account, as intermediate symbols are taken to serve a purpose, a purpose which is easy to recognize but not so easy to pin down and specify exactly.  Nevertheless, it is worth the trouble to explore the intermediate level of organization and its development a little further.

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 5

  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.