Cactus Language • Syntax 1

Grammar 1

Grammar 1 is something of a misnomer.  It is nowhere near exemplifying any kind of a standard form and it’s put forth only as a starting point for the initiation of more respectable grammars.  Such as it is, it uses the terminal alphabet \mathfrak{A} = \mathfrak{M} \cup \mathfrak{P} coming with the territory of the cactus language \mathfrak{C} (\mathfrak{P}), it specifies \mathfrak{Q} = \varnothing, in other words, it employs no intermediate symbols, and it embodies the covering set \mathfrak{K} as listed in the following display.

Cactus Language Grammar 1

The last two rules of Grammar 1 dictate the following typings.

  1. The concept of a sentence in \mathfrak{L} covers any concatenation of sentences in \mathfrak{L}, that is, any finite number of freely chosen sentences available to be concatenated one after another.
  2. The concept of a sentence in \mathfrak{L} covers any surcatenation of sentences in \mathfrak{L}, that is, any string opening with a ``\mathrm{(}", continuing with a sentence, possibly empty, following with a finite number of phrases of the form ``\mathrm{,}" \cdot S, and closing with a ``\mathrm{)}".

The above appears to be just about the most concise description of the cactus language \mathfrak{C} (\mathfrak{P}) one can imagine but there are a couple of problems commonly felt to afflict its style of presentation and to make it less than completely acceptable.  Briefly stated, the problems turn on the following properties of the formulation.

  • The invocation of the kleene star operation is not reduced to a manifestly finitary form.
  • The type S indicative of a sentence is allowed to cover not only itself but also the empty string.

We’ll discuss those issues at first in general, and especially in regard to how the two features interact with one another, and then we’ll return to address in further detail the questions they engender on their individual bases.

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 1

  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.