The easiest way to define the language is to indicate the general run of operations required to construct the greater share of its sentences from the designated few which require a special election.
To do that we introduce a family of operations called syntactic connectives on the strings of If the strings on which they operate are already sentences of
then the operations amount to sentential connectives. If the syntactic sentences, viewed as abstract strings of uninterpreted signs, are provided with a semantics where they denote propositions, in other words, indicator functions on a universe of discourse, then the operations amount to propositional connectives.
Rather than presenting the most concise description of cactus languages right from the beginning, it aids comprehension to develop a picture of their forms in gradual stages, starting with the most natural ways of viewing their elements, if somewhat at a distance, and working through the most easily grasped impressions of their structures, if not always the sharpest acquaintances with their details.
We begin by defining two sets of basic operations on strings of
- Concatenation
-
The concatenation of one string
is the string
The concatenation of two strings
is the string
The concatenation of
strings
is the string
- Surcatenation
-
The surcatenation of one string
is the string
The surcatenation of two strings
is the string
The surcatenation of
strings
is the string
Resources
cc: Academia.edu • BlueSky • Laws of Form • Mathstodon • Research Gate
cc: Conceptual Graphs • Cybernetics • Structural Modeling • Systems Science
Pingback: Survey of Animated Logical Graphs • 7 | Inquiry Into Inquiry
Pingback: Survey of Animated Logical Graphs • 8 | Inquiry Into Inquiry
Pingback: Survey of Animated Logical Graphs • 8 | Systems Community of Inquiry