Cactus Language • Syntax 12

Grammar 6

Grammar 6 has the intermediate alphabet \mathfrak{Q} = \{ ``S'", ``F", ``R", ``T" \} with the set \mathfrak{K} of covering rules listed in the next display.

Cactus Language Grammar 6

Our exploration of the grammar space for the language \mathfrak{C} (\mathfrak{P}) shows how an initially effective and succinct definition of a formal language can be terse to the point of forcing its interpreters to spend exorbitant amounts of time developing its consequences, but that it can be converted to a form more efficient from the operational point of view, however ungainly in regard to its elegance.

The main idea behind the grammar‑grinding remains the same, to give concrete implementation to the following general rule.

Cactus Language General Rule

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 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.