Cactus Language • Pragmatics 16

Stricture, Strait, Constraint, Information, Complexity

The ways in which strictures and straits at different levels of complexity relate to one another can be given systematic treatment by introducing the following pair of definitions.

Excerpt of a Stricture
The j^\text{th} excerpt of a stricture ``S_1 \times \ldots \times S_k", regarded in a frame of discussion where the number of places is bounded by k, is a stricture of the form ``X \times \ldots \times S_j \times \ldots \times X".

The j^\text{th} excerpt can be written more briefly in context as the stricture ``(S_j)_{[j]}", an assertion which places the j^\text{th} set in the j^\text{th} place of the product.

Extract of a Strait
The j^\text{th} extract of a strait S_1 \times \ldots \times S_k, regarded in a frame of discussion where the number of places is bounded by k, is a strait of the form X \times \ldots \times S_j \times \ldots \times X.

The j^\text{th} extract can be denoted more briefly in context by the stricture ``(S_j)_{[j]}", an assertion which places the j^\text{th} set in the j^\text{th} place of the product.

Using the above definitions, a stricture of the form ``S_1 \times \ldots \times S_k" can be expressed in terms of simpler strictures, namely, as the following conjunction of its individual excerpts.

\begin{array}{lll}  ``S_1 \times \ldots \times S_k" & = & ``(S_1)_{[1]}" \land \ldots \land ``(S_k)_{[k]}"  \end{array}

In a similar vein, a strait of the form S_1 \times \ldots \times S_k can be expressed in terms of simpler straits, namely, as the following intersection of its individual extracts.

\begin{array}{lll}  S_1 \times \ldots \times S_k & = & (S_1)_{[1]} \cap \ldots \cap (S_k)_{[k]}  \end{array}

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 • Pragmatics 16

  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.