Cactus Language • Mechanics 5

Re: Cactus Language • Mechanics 4

The following Table summaries the mechanics of the parsing rules given in the previous post.

\text{Algorithmic Translation Rules}
Algorithmic Translation Rules

A substructure of a painted and rooted cactus C is defined recursively as follows.  Starting from the root node of the cactus C, each of its attachments is a substructure of C.  If a substructure is a blank or a paint then it constitutes a minimal substructure, meaning no further substructures of C arise from it.  If a substructure is a lobe then each of its appendants is also a substructure of C and needs to be examined for further substructures.

The concept of substructure can be used to define the varieties of deletion and erasure operations which respect the structure of the abstract graph.  In that application a blank symbol “ ” is treated as a primer, in other words, a clear paint or neutral tint, in effect letting m_1 = p_0.  In that frame of discussion it is useful to make the following distinction.

  • To delete a substructure is to replace it with an empty node, in effect, to reduce the whole structure to a trivial point.
  • To erase a substructure is to replace it with a blank symbol, in effect, to paint it out of the picture or overwrite it.

A bare PARC, loosely referred to as a bare cactus, is a painted and rooted cactus on the empty palette \mathfrak{P} = \varnothing.  A bare cactus can be described in various ways, depending on how the form arises in practice.

  • Leaning on the definition of a bare PARCE, a bare PARC can be described as the type of parse graph which arises from parsing a bare cactus expression, in other words, from parsing a sentence of the bare cactus language \mathfrak{C}^0 = \mathrm{PARCE}^0.
  • To express it more in its own terms, a bare PARC can be defined by tracing the recursive definition of a generic PARC, but then by detaching an independent form of description from the source of that analogy.  The method is sufficiently sketched as follows.
    • A bare PARC is a PARC whose attachments are limited to blanks and bare lobes.
    • A bare lobe is a lobe whose appendants are limited to bare PARCs.
  • In practice a bare cactus is usually encountered in the process of analyzing or handling an arbitrary PARC, the circumstances of which frequently call for deleting or erasing its paints.  Among other things, that generally makes it easier to observe the unadorned properties of its underlying graphical structure.

Resources

cc: Academia.edu • BlueSky • Laws of FormMathstodonResearch Gate
cc: Conceptual Graphs • CyberneticsStructural 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 • Mechanics 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.