Changes

The informal mechanisms that have been illustrated in the immediately preceding discussion are enough to equip the rest of this discussion with a moderately exact description of the so-called ''cactus language'' that I intend to use in both my conceptual and my computational representations of the minimal formal logical system that is variously known to sundry communities of interpretation as ''propositional logic'', ''sentential calculus'', or more inclusively, ''zeroth order logic'' (ZOL).

The informal mechanisms that have been illustrated in the immediately preceding discussion are enough to equip the rest of this discussion with a moderately exact description of the so-called ''cactus language'' that I intend to use in both my conceptual and my computational representations of the minimal formal logical system that is variously known to sundry communities of interpretation as ''propositional logic'', ''sentential calculus'', or more inclusively, ''zeroth order logic'' (ZOL).

The ''painted cactus language'' !C! is actually a parameterized family of languages, consisting of one language !C!(!P!) for each set !P! of ''paints''.

The ''painted cactus language'' <math>\mathfrak{C}</math> is actually a parameterized family of languages, consisting of one language <math>\mathfrak{C}(\mathfrak{P})</math> for each set <math>\mathfrak{P}</math> of ''paints''.

<pre>

<pre>